Login / Signup
On the Equivalence in Complexity Among Three Computation Problems on Maximum Number of Edge-Disjoint s-t Paths in a Probabilistic Graph.
Peng Chen
Shigeru Masuyama
Published in:
Inf. Process. Lett. (1994)
Keyphrases
</>
maximum number
edge disjoint
spanning tree
decision problems
optimization problems
computational complexity
space complexity
probabilistic approaches
total length
probabilistic planning
np hardness
path finding
graph theory
bipartite graph
belief networks
np complete
probabilistic model