An \(n^ 2\) algorithm for determining the bridges of a graph

DOI10.1016/0020-0190(71)90005-6zbMath0231.68016OpenAlexW2018806678MaRDI QIDQ2550626

Derek Gordon Corneil

Publication date: 1971

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(71)90005-6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Finding fundamental cycles and bridges on a tree-structured parallel computer

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel concepts in graph theory
• A contribution to the development of ALGOL
• An Analysis of Some Graph Theoretical Cluster Techniques
• On cliques in graphs