On shortest disjoint paths in planar graphs.

Yusuke Kobayashi Christian Sommer

Published in: Discret. Optim. (2010)

Keyphrases

planar graphs
disjoint paths
undirected graph
approximation algorithms
shortest path
directed graph
spanning tree
minimum cost
complex networks
connected components
greedy algorithm
directed acyclic graph
linear programming
closed form
approximate inference