Optimal parallel algorithms for path problems on planar graphs
From MaRDI portal
Publication:673083
DOI10.1016/0304-3975(94)00189-PzbMATH Open0874.68232OpenAlexW2053126040MaRDI QIDQ673083FDOQ673083
Authors: G. Srikrishna, C. Pandu Rangan 
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00189-p
Recommendations
- A linear algorithm for the all-bidirectional-edges problem on planar graphs
- A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs
- Optimal parallel algorithms on planar graphs
- A linear-time algorithm for edge-disjoint paths in planar graphs
- scientific article; zbMATH DE number 4060742
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Cites Work
- Title not available (Why is that?)
- The directed subgraph homeomorphism problem
- A Polynomial Solution to the Undirected Two Paths Problem
- Disjoint paths in graphs
- Parallel Prefix Computation
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Efficient Parallel Biconnectivity Algorithm
- On the Computational Complexity of Combinatorial Problems
- Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Towards optimal parallel bucket sorting
- A linear algorithm for the all-bidirectional-edges problem on planar graphs
- Optimal parallel algorithm for finding \(st\)-ambitus of a planar biconnected graph
- Title not available (Why is that?)
Cited In (8)
- On the complexity of optimal parallel cooperative path-finding
- A linear algorithm for the all-bidirectional-edges problem on planar graphs
- Optimal parallel algorithm for finding \(st\)-ambitus of a planar biconnected graph
- Notes on 'divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model'
- An efficient parallel algorithm for shortest paths in planar layered digraphs
- Bidirectional edges problem. I: A simple algorithm
- Parallel complexity of computing a maximal set of disjoint paths
- A simple parallel algorithm for the single-source shortest path problem on planar digraphs
This page was built for publication: Optimal parallel algorithms for path problems on planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673083)
