Finding Triconnected Components by Local Replacement

DOI10.1137/0222040MaRDI QIDQ4202214zbMATH OpenOpenAlexFDO

Authors Donald S. Fussell, Vijaya Ramachandran, Ramakrishna Thurimella

Publication date 1 September 1993

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0222040

zbMATH Keywords

graphlocal replacementparallel algorithmPRAMtime complexitytriconnected componentsvertex connectivity

Mathematics Subject Classification ID

Connectivity (05C40) Distributed algorithms (68W15) Communication networks in operations research (90B18)

Recommendations

• A new graph triconnectivity algorithm and its parallelization
• scientific article; zbMATH DE number 4060743
• A parallel algorithm for finding a triconnected component separator with an application
• An efficient and fast parallel-connected component algorithm
• An Efficient Parallel Biconnectivity Algorithm

Cited in

(9)

• A new graph triconnectivity algorithm and its parallelization
• On testing consecutive-ones property in parallel
• A parallel algorithm for finding a triconnected component separator with an application
• Planarity testing in parallel
• Efficient algorithms for acyclic colorings of graphs
• A linear-time certifying algorithm for recognizing generalized series-parallel graphs
• scientific article; zbMATH DE number 4060743 (Why is no real title available?)
• scientific article; zbMATH DE number 7765396 (Why is no real title available?)
• Recognizing and representing proper interval graphs in parallel using merging and sorting

This page was built for publication: Finding Triconnected Components by Local Replacement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4202214)