Work

Connected Components in Linear Work and Near-Optimal Time

Year: 2024
Type: conference-paper
Abstract: Computing the connected components of a graph is a fundamental problem in algorithmic graph theory. A major question in this area is whether we can compute connected components in o(log n) parallel time. Recent works showed an affirmative answer in the Massively Parallel Computation (MPC) model for a wide class of graphs. Specifically, Behnezhad et al. (FOCS'19) showed that connected components can be computed in O(log d + log log n) rounds in the MPC model. More recently, Liu et al. (SPAA'20) showed that the same result can be achieved in the standard PRAM model but their result incurs Θ((m+n) ⋅ (log d + log log n)) work which is sub-optimal.
Language: English
Open Access status: hybrid
OpenAlex ID: W4399342829
FWCI:
Cites: 34
Cited by:
Related to: 10