A new graph triconnectivity algorithm and its parallelization

DOI10.1007/BF01191205zbMath0753.05064MaRDI QIDQ1193533

Vijaya Ramachandran, Gary Lee Miller

Publication date: 27 September 1992

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

parallelizationgraph triconnectivity algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Distributed algorithms (68W15)

Related Items

Approximation algorithms for classes of graphs excluding single-crossing graphs as minors, Planarity testing in parallel, Fully dynamic 2-edge-connectivity in planar graphs, An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs, Certifying algorithms, Counting the number of perfect matchings in \(K_{5}\)-free graphs, Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge, Parallel search algorithms for graphs and trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved algorithms for graph four-connectivity
• Parallel ear decomposition search (EDS) and st-numbering in graphs
• An Efficient Parallel Biconnectivity Algorithm
• Parallel Merge Sort
• Parallel Algorithms in Graph Theory: Planarity Testing
• Non-Separable and Planar Graphs
• Dividing a Graph into Triconnected Components