An Experimental Study of Algorithms for Computing the Edge Connectivity of a Directed Graph

Loukas Georgiadis, Dionysios Kefallinos, Luigi Laura, Nikos Parotsidis. An Experimental Study of Algorithms for Computing the Edge Connectivity of a Directed Graph. In Martin Farach-Colton, Sabine Storandt, editors, Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2021, Virtual Conference, January 10-11, 2021. pages 85-97, SIAM, 2021. [doi]

Abstract

Abstract is missing.