Year: 2025
Type: conference-paper
Abstract: In this paper, we show the first deterministic parallel algorithm for computing the strongly connected components (SCCs) of a directed graph beyond the full transitive closure computation. For any parameter t ϵ [1, n], the algorithm can identify the SCCs within Õ(nt2 + m) work and Õ(n/t) depth. This matches (up to polylogarithmic factors) the state-of-the-art deterministic tradeoff for st-reachability and solves an open problem of Spencer [J. ACM '97].
Authors: Adam Karczmarz, Bartłomiej Lewandowski
Institution: University of Warsaw
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Funder: Narodowe Centrum Badań i Rozwoju
OpenAlex ID: W4412480892