O(mlogn) split decomposition of strongly-connected graphs.

Benson L. Joeris Scott M. Lundberg Ross M. McConnell

Published in: Discret. Appl. Math. (2010)

Keyphrases

strongly connected
directed graph
optimum path forest
undirected graph
random walk
decomposition method
decomposition methods
lower bound
special case