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

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Loukas Georgiadis' in GoogleThis author has not been identified. Look up 'Giuseppe F. Italiano' in GoogleThis author has not been identified. Look up 'Aikaterini Karanasiou' in GoogleThis author has not been identified. Look up 'Nikos Parotsidis' in GoogleThis author has not been identified. Look up 'Nilakantha Paudel' in Google

runs on WebDSL