Login / Signup
An Efficient Algorithm for the Vertex-Disjoint Paths Problem in Random Graphs.
Andrei Z. Broder
Alan M. Frieze
Stephen Suen
Eli Upfal
Published in:
SODA (1996)
Keyphrases
</>
random graphs
undirected graph
search space
learning algorithm
objective function
np hard
dynamic programming
worst case
image segmentation
computational complexity
simulated annealing
tree structure
social interaction
attributed graphs
minimum length