Login / Signup
On the complexity of the planar directed edge-disjoint paths problem.
Dirk Müller
Published in:
Math. Program. (2006)
Keyphrases
</>
disjoint paths
approximation algorithms
undirected graph
directed graph
worst case
computational complexity
edge detection
decision problems
computer vision
xml documents
multi dimensional
multi view
np complete
random walk
space complexity