On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary.

Werner Schwärzler

Published in: Comb. (2009)

Keyphrases

disjoint paths
approximation algorithms
undirected graph
directed graph
worst case
computational complexity
image segmentation
state space
level set
active contours