A randomized subquadratic-time algorithm finds (k+2)-edge-connected components in k-edge-connected digraphs for k up to o(n^{1/4}/√log n).
In2024 Symposium on Simplicity in Algorithms (SOSA)(2024), pp
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time
A randomized subquadratic-time algorithm finds (k+2)-edge-connected components in k-edge-connected digraphs for k up to o(n^{1/4}/√log n).