O(m logn) Split Decomposition of Strongly Connected Graphs [chapter]

Benson L. Joeris, Scott Lundberg, Ross M. McConnell
2009 Lecture Notes in Computer Science  
In the early 1980's, Cunningham described a unique decomposition of a strongly-connected graph. A linear time bound for finding it in the special case of an undirected graph has been given previously, but up until now, the best bound known for the general case has been O(n 3 ). We give an O(m log n) bound.
doi:10.1007/978-3-642-02029-2_16 fatcat:chdvtrj7uzg6xmsdfwpef4mmfe