A Simpler Parallel Algorithm for Graph Connectivity
From MaRDI portal
Publication:4285909
DOI10.1006/jagm.1994.1009zbMath0797.68071MaRDI QIDQ4285909
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
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C40: Connectivity
68W15: Distributed algorithms
Related Items
Graph Connectivity in Log Steps Using Label Propagation, A faster parallel algorithm for \(k\)-connectivity, Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM