How to make a strongly connected digraph two-connected

Additional Metadata
MSC	Connectivity (msc 05C40)
Publisher	Springer
Series	Lecture Notes in Computer Science
Conference	International Conference on Integer Programming and Combinatorial Optimization
Citation APA APA Style APA-ALL Style AAA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Frank, A.& Jordán, T. (1995). How to make a strongly connected digraph two-connected. Integer Programming and Combinatorial Optimization, 414–425.

Publication