Finding Connected Components in O(log n log log n) Time on the EREW PRAM
From MaRDI portal
Publication:4837541
DOI10.1006/jagm.1995.1016zbMath0834.68089OpenAlexW4249333804WikidataQ58063089 ScholiaQ58063089MaRDI QIDQ4837541
Publication date: 3 July 1995
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1995.1016
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
A faster parallel connectivity algorithm on cographs ⋮ An Optimal Parallel Algorithm for Minimum Spanning Trees in Planar Graphs ⋮ The interval-merging problem ⋮ NC Algorithms for Weighted Planar Perfect Matching and Related Problems ⋮ Edge-matching graph contractions and their interlacing properties ⋮ Connectivity Oracles for Graphs Subject to Vertex Failures
This page was built for publication: Finding Connected Components in O(log n log log n) Time on the EREW PRAM
