Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study

Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Nikos Parotsidis, Nilakantha Paudel. Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study. In Rasmus Pagh, Suresh Venkatasubramanian, editors, Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018. pages 169-183, SIAM, 2018. [doi]

Abstract

Abstract is missing.