Pages that link to "Item:Q582094"
From MaRDI portal
The following pages link to Optimal parallel algorithms on planar graphs (Q582094):
Displaying 20 items.
- Optimal parallel algorithms for path problems on planar graphs (Q673083) (← links)
- Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms (Q758188) (← links)
- An optimal parallel processor bound in strong orientation of an undirected graph (Q1062459) (← links)
- An efficient parallel algorithm for planarity (Q1114415) (← links)
- Improved deterministic parallel integer sorting (Q1175944) (← links)
- Efficient parallel algorithms for shortest paths in planar digraphs (Q1196454) (← links)
- A simple parallel algorithm for computing the diameters of all vertices in a tree and its application (Q1198069) (← links)
- Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems (Q1351004) (← links)
- Efficient computation of implicit representations of sparse graphs (Q1377648) (← links)
- An optimal parallel algorithm for planar cycle separators (Q1900892) (← links)
- Optimal parallel algorithm for finding \(st\)-ambitus of a planar biconnected graph (Q1908264) (← links)
- Parallel complexity of partitioning a planar graph into vertex-induced forests (Q1923610) (← links)
- An Optimal Parallel Algorithm for Minimum Spanning Trees in Planar Graphs (Q3464472) (← links)
- Parallel Algorithms for Depth-First Searches I. Planar Graphs (Q3753502) (← links)
- (Q3815886) (← links)
- Parallel Transitive Closure and Point Location in Planar Structures (Q3978176) (← links)
- Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases (Q4508634) (← links)
- Parallel algorithms with optimal speedup for bounded treewidth (Q4645184) (← links)
- Improved parallel depth-first search in undirected planar graphs (Q5060132) (← links)
- Fast and optimal simulations between CRCW PRAMs (Q5096768) (← links)