On Strongly Connected Digraphs with Bounded Cycle Length

Samir Khuller Balaji Raghavachari Neal E. Young

Published in: CoRR (2002)

Keyphrases

strongly connected
directed graph
undirected graph
optimum path forest
random walk
equivalence classes
minimal length
total length
fixed length
maximum number
directed acyclic graph
database
graph structure
graphical models
multi dimensional
state space
special case