O (m log n) split decomposition of strongly-connected graphs

Citations of this article
Mendeley users who have this article in their library.


In the early 1980s, 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 (n3). We give an O (m log n) bound. © 2009 Elsevier B.V. All rights reserved.




Joeris, B. L., Lundberg, S., & McConnell, R. M. (2010). O (m log n) split decomposition of strongly-connected graphs. Discrete Applied Mathematics, 158(7), 779–799. https://doi.org/10.1016/j.dam.2009.10.008

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free