Finding Triconnected Components by Local Replacement
From MaRDI portal
Publication:4202214
DOI10.1137/0222040zbMath0778.05052OpenAlexW2001994005MaRDI QIDQ4202214
Ramakrishna Thurimella, Vijaya Ramachandran, Donald S. Fussell
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
graphparallel algorithmtime complexityPRAMvertex connectivitylocal replacementtriconnected components
Communication networks in operations research (90B18) Connectivity (05C40) Distributed algorithms (68W15)
Related Items
A parallel algorithm for finding a triconnected component separator with an application, Planarity testing in parallel, Recognizing and representing proper interval graphs in parallel using merging and sorting, Unnamed Item, Efficient algorithms for acyclic colorings of graphs, On testing consecutive-ones property in parallel, A linear-time certifying algorithm for recognizing generalized series-parallel graphs