What structural features make graph problems to have efficirnt parallel algorithms? - Using outerplanar graphs, trapezoid graphs and in-tournament graphs as examples

• Autores: Shigeru Masuyama, Shinichi Nakayama
• Localización: IEICE transactions on information and systems, ISSN 0916-8532, Vol. 83, Nº 3, 2000, págs. 541-549
• Idioma: inglés
• Texto completo no disponible (Saber más ...)