On Strongly Connected Digraphs with Bounded Cycle Length.

Samir Khuller Balaji Raghavachari Neal E. Young

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

Keyphrases

strongly connected
directed graph
undirected graph
optimum path forest
random walk
fixed length
total length
case study
approximation algorithms
directed acyclic graph
hidden markov models
shortest path
maximum number
markov models
equivalence classes
minimal length