An optimal parallel co-connectivity algorithm

DOI10.1007/s00224-003-1074-xzbMath1088.68671OpenAlexW2065159944MaRDI QIDQ1882536

Leonidas Palios, Stavros D. Nikolopoulos, Ka Wong Chong

Publication date: 1 October 2004

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-003-1074-x

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

On the parallel computation of the biconnected and strongly connected co-components of graphs ⋮ On parallel recognition of cographs ⋮ Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions ⋮ Efficient parallel recognition of cographs ⋮ On the Strongly Connected and Biconnected Components of the Complement of Graphs

This page was built for publication: An optimal parallel co-connectivity algorithm