Parallel algorithms for planar graph isomorphism and related problems
From MaRDI portal
Publication:3801100
DOI10.1109/31.1743zbMath0654.68092OpenAlexW2105487688MaRDI QIDQ3801100
S. Rao Kosaraju, Joseph F. Ja'Ja'
Publication date: 1988
Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1903/4509
parallel algorithmsseparating cycleCREW-PRAMmodels of parallel computationarray of processorsplanar graph isomorphismcoarsest partitioning
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
An efficient parallel algorithm for the single function coarsest partition problem ⋮ Improved parallel depth-first search in undirected planar graphs ⋮ An optimal parallel algorithm for planar cycle separators ⋮ A model classifying algorithms as inherently sequential with applications to graph searching ⋮ Distributed Testing of Graph Isomorphism in the CONGEST Model. ⋮ Not all planar digraphs have small cycle separators ⋮ Parallel search algorithms for graphs and trees ⋮ Topological recognition of polyhedral objects from multiple views ⋮ An external-memory depth-first search algorithm for general grid graphs ⋮ Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
This page was built for publication: Parallel algorithms for planar graph isomorphism and related problems
