Parallel Algorithms in Graph Theory: Planarity Testing
From MaRDI portal
Cited in
(22)- Topological queries in spatial databases
- An efficient parallel algorithm for planarity
- Finding small simple cycle separators for 2-connected planar graphs
- Fast algorithms for lowest common ancestors on a processor array with reconfigurable buses
- An efficient parallel algorithm for finding rectangular duals of plane triangular graphs
- NC algorithms for computing a perfect matching and a maximum flow in one-crossing-minor-free graphs
- Parallel dynamic lowest common ancestors
- Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata
- Parallel O(log n) time edge-colouring of trees and Halin graphs
- Parallel computation and conflicts in memory access
- The complexity of planarity testing
- Parallel strong orientation of an undirected graph
- Parallel ear decomposition search (EDS) and st-numbering in graphs
- On the complexity of the stability problem of binary freezing totalistic cellular automata
- A new graph triconnectivity algorithm and its parallelization
- Planarity testing in parallel
- Formula dissection: A parallel algorithm for constraint satisfaction
- A parallel search algorithm for directed acyclic graphs
- A note on finding minimum cuts in directed planar networks by parallel computations
- Planarity testing revisited
- Parallel computations on graphs
- NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems
This page was built for publication: Parallel Algorithms in Graph Theory: Planarity Testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3957959)
