Length-bounded disjoint paths in planar graphs.

Hein van der Holst José Coelho de Pina

Published in: Discret. Appl. Math. (2002)

Keyphrases

planar graphs
disjoint paths
undirected graph
approximation algorithms
directed graph
connected components
approximate inference
minimum cost
minimum weight
complex networks
graph structure
directed acyclic graph
spanning tree
edge map