Amr Elmasry. Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs. In Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park, editors, Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II. Volume 6507 of Lecture Notes in Computer Science, pages 375-386, Springer, 2010. [doi]
Abstract is missing.