On Shortest Disjoint Paths in Planar Graphs.

Yusuke Kobayashi Christian Sommer

Published in: ISAAC (2009)

Keyphrases

planar graphs
disjoint paths
undirected graph
approximation algorithms
directed graph
shortest path
spanning tree
connected components
minimum weight
complex networks
minimum cost
graph structure
approximate inference
directed acyclic graph
special case
np hard
gray scale