Show simple item record

Parallel Algorithms for Planar Graph Isomorphism and Related Problems.

dc.contributor.authorJaJa, Joseph F.en_US
dc.contributor.authorKosaraju, S. Raoen_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.relation.ispartofseriesISR; TR 1986-86en_US
dc.titleParallel Algorithms for Planar Graph Isomorphism and Related Problems.en_US
dc.typeTechnical Reporten_US

Files in this item


This item appears in the following Collection(s)

Show simple item record