Optimal parallel algorithms for path problems on planar graphs

DOI10.1016/0304-3975(94)00189-PzbMath0874.68232OpenAlexW2053126040MaRDI QIDQ673083

C. Pandu Rangan, G. Srikrishna

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

zbMATH Keywords

all-bidirectional-edgesbiconnected planar graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Cites Work

• Towards optimal parallel bucket sorting
• The directed subgraph homeomorphism problem
• Disjoint paths in graphs
• A linear algorithm for the all-bidirectional-edges problem on planar graphs
• Optimal parallel algorithm for finding \(st\)-ambitus of a planar biconnected graph
• An Efficient Parallel Biconnectivity Algorithm
• Parallel Prefix Computation
• A Polynomial Solution to the Undirected Two Paths Problem
• On the Computational Complexity of Combinatorial Problems
• Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal parallel algorithms for path problems on planar graphs