A parallel algorithm for finding a triconnected component separator with an application

DOI10.1016/0020-0190(94)00147-2zbMath0847.68044OpenAlexW1975955995MaRDI QIDQ1339375

Zhi-Zhong Chen

Publication date: 29 September 1996

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

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00147-2

zbMATH Keywords

separatorbiconnected graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Connectivity (05C40) Distributed algorithms (68W15)

Cites Work

• Extending planar graph algorithms to \(K_{3,3}\)-free graphs
• Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms
• An approach to the subgraph homeomorphism problem
• NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems
• An Efficient Parallel Biconnectivity Algorithm
• A fast parallel algorithm for the maximal independent set problem
• Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets
• Finding Triconnected Components by Local Replacement

This page was built for publication: A parallel algorithm for finding a triconnected component separator with an application