Parallel Algorithms for Planar Graph Isomorphism and Related Problems.

Simple item page
dc.contributor.authorJaJa, Joseph F.en_US
dc.contributor.authorKosaraju, S. Raoen_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T09:36:12Z
dc.date.available2007-05-23T09:36:12Z
dc.date.issued1986en_US
dc.description.abstractWe present new efficient parallel algorithms for planar graph isomorphism and several related problems. Our main parallel model is the SQRT n x SQRT n mesh of processors, where n is the length of the input. Our results include O(SQRT n) time algorithms for finding a good separating cycle and the triconnected components of a planar graph, and for solving the single function coarsest partitioning problem.en_US
dc.format.extent829830 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/4509
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1986-86en_US
dc.titleParallel Algorithms for Planar Graph Isomorphism and Related Problems.en_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_86-86.pdf
Size:
810.38 KB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports