Pages that link to "Item:Q1114415"
From MaRDI portal
The following pages link to An efficient parallel algorithm for planarity (Q1114415):
Displaying 20 items.
- Efficient parallel algorithms for doubly convex-bipartite graphs (Q672468) (← links)
- Parallel nested dissection for path algebra computations (Q1095781) (← links)
- An optimal parallel algorithm for triangulating a set of points in the plane (Q1100899) (← links)
- An efficient parallel algorithm for planarity (Q1114415) (← links)
- A parallel algorithm for finding congruent regions (Q1262793) (← links)
- Optimal parallel algorithms on circular-arc graphs (Q1263980) (← links)
- On testing consecutive-ones property in parallel (Q1281757) (← links)
- Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs (Q1317488) (← links)
- Planarity testing in parallel (Q1342859) (← links)
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs (Q1345961) (← links)
- PC trees and circular-ones arrangements. (Q1401263) (← links)
- An efficient parallel algorithm for finding rectangular duals of plane triangular graphs (Q1892581) (← links)
- The Monotone Circuit Value Problem with Bounded Genus Is in NC (Q2817851) (← links)
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms (Q3508575) (← links)
- A Randomized Parallel Algorithm for Planar Graph Isomorphism (Q4209267) (← links)
- Bijective comparison of optimal planarity algorithms (Q4838131) (← links)
- (Q5068485) (← links)
- (Q5091009) (← links)
- A fully dynamic algorithm for planar (Q5361574) (← links)
- Synchronized Planarity with Applications to Constrained Planarity Problems (Q6075858) (← links)
