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

Shigeru Masuyama and Shin-ichi Nakayama
IEICE Trans. Information & Systems E83D(3):541–549, Mar 2000

Cites:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!