Faster Computation of 3-Edge-Connected Components in Digraphs

Loukas Georgiadis, Evangelos Kipouridis, Charis Papadopoulos, Nikos Parotsidis. Faster Computation of 3-Edge-Connected Components in Digraphs. In Nikhil Bansal 0001, Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023. pages 2489-2531, SIAM, 2023. [doi]

Abstract

Abstract is missing.