Efficient algorithms for disjoint paths in planar graphs.

Heike Ripphausen-Lipa Dorothea Wagner Karsten Weihe

Published in: Combinatorial Optimization (1993)

Keyphrases

planar graphs
disjoint paths
undirected graph
approximation algorithms
directed graph
directed acyclic graph
complex networks
minimum cost
spanning tree
connected components
minimum weight
approximate inference
parameter estimation
maximum likelihood
image segmentation
bipartite graph
higher order
np hard
pairwise