A Simpler Parallel Algorithm for Graph Connectivity

DOI10.1006/JAGM.1994.1009MaRDI QIDQ4285909zbMATH OpenOpenAlexFDO

Authors Yahiko Kambayashi, Kazuo Iwama

Publication date 19 October 1994

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1994.1009

zbMATH Keywords

expander graphsgraph connectivityundirected graphconnected componentsCRCW PRAM algorithm

Mathematics Subject Classification ID

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

Recommendations

• Parallel algorithms for finding connected components of a graph
• Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM
• Fast Connected Components Algorithms for the EREW PRAM
• Finding Connected Components in O(log n log log n) Time on the EREW PRAM
• An efficient and fast parallel-connected component algorithm

Cited in

(7)

• A faster parallel connectivity algorithm on cographs
• A faster parallel algorithm for \(k\)-connectivity
• Parallel algorithms for connectivity problems in graph theory
• Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM
• An Efficient Parallel Biconnectivity Algorithm
• scientific article; zbMATH DE number 3930349 (Why is no real title available?)
• Graph connectivity in log steps using label propagation

This page was built for publication: A Simpler Parallel Algorithm for Graph Connectivity

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