Parallel algorithms for planar graph isomorphism and related problems
From MaRDI portal
Recommendations
Cited in
(22)- An external-memory depth-first search algorithm for general grid graphs
- An efficient parallel algorithm for planarity
- A model classifying algorithms as inherently sequential with applications to graph searching
- Finding congruent regions in parallel
- Not all planar digraphs have small cycle separators
- Parallel search algorithms for graphs and trees
- Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
- An efficient parallel algorithm for the single function coarsest partition problem
- An optimal simple parallel algorithm for testing isomorphism of maximal outerplanar graphs
- An efficient parallel algorithm for finding rectangular duals of plane triangular graphs
- An optimal parallel algorithm for planar cycle separators
- Parallel recognition algorithms for chordal-planar graphs and planar k-trees
- scientific article; zbMATH DE number 4049079 (Why is no real title available?)
- scientific article; zbMATH DE number 4060741 (Why is no real title available?)
- Parallel Tree Contraction Part 2: Further Applications
- A Randomized Parallel Algorithm for Planar Graph Isomorphism
- scientific article; zbMATH DE number 3995071 (Why is no real title available?)
- Parallel algorithms for P4-comparability graphs
- Parallel Algorithm for Solving the Graph Isomorphism Problem
- Improved parallel depth-first search in undirected planar graphs
- Topological recognition of polyhedral objects from multiple views
- Distributed Testing of Graph Isomorphism in the CONGEST Model.
This page was built for publication: Parallel algorithms for planar graph isomorphism and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3801100)