A Lower Bound of the Expected Maximum Number of Edge-disjoint S-t Paths on Probabilistic Graphs.
Peng ChengShigeru MasuyamaPublished in: Discret. Appl. Math. (1995)
Keyphrases
- maximum number
- lower bound
- edge disjoint
- spanning tree
- upper bound
- total length
- branch and bound algorithm
- objective function
- lower and upper bounds
- np hard
- undirected graph
- bayesian networks
- running times
- probabilistic model
- worst case
- branch and bound
- graph theoretic
- graph theory
- probabilistic logic
- shortest path
- optimal solution
- generative model
- minimum cost
- lower bounding
- constant factor