Lower bounds on the lengths of node sequences in directed graphs.
George MarkowskyRobert Endre TarjanPublished in: Discret. Math. (1976)
Keyphrases
- directed graph
- lower bound
- random walk
- upper bound
- graph structure
- undirected graph
- branch and bound algorithm
- branch and bound
- objective function
- hidden markov models
- sequential patterns
- disjoint paths
- vc dimension
- lower and upper bounds
- maximum flow
- worst case
- machine learning
- strongly connected
- directed acyclic graph
- web graph