A linear algorithm for the all-bidirectional-edges problem on planar graphs

DOI10.1007/BF01190896zbMath0768.68173OpenAlexW2066138488MaRDI QIDQ1209732

C. Pandu Rangan, P. B. Ramprasad

Publication date: 16 May 1993

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01190896

zbMATH Keywords

pathgraph algorithmsplanar graphedge-labelingall-bidirectional-edges problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Optimal parallel algorithms for path problems on planar graphs ⋮ A linear algorithm for the all-bidirectional-edges problem on planar graphs

Cites Work

• Disjoint paths in graphs
• A linear algorithm for the all-bidirectional-edges problem on planar graphs
• A Polynomial Solution to the Undirected Two Paths Problem
• Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
• Dividing a Graph into Triconnected Components

This page was built for publication: A linear algorithm for the all-bidirectional-edges problem on planar graphs