A linear-time algorithm for finding an ambitus

DOI10.1007/BF01758776zbMath0768.05087OpenAlexW1966836445MaRDI QIDQ1186786

S. Singh

Publication date: 28 June 1992

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

pathscyclegraph algorithmsbridgesambitus

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Crossing number and weighted crossing number of near-planar graphs ⋮ Crossing and Weighted Crossing Number of Near-Planar Graphs ⋮ A lower bound of the expected maximum number of edge-disjoint \(s\)--\(t\) paths on probabilistic graphs

Cites Work

• Bridges and Hamiltonian circuits in planar graphs
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• Efficient Planarity Testing
• Dividing a Graph into Triconnected Components
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A linear-time algorithm for finding an ambitus