Edge-disjoint paths in Planar graphs with constant congestion.

Chandra Chekuri Sanjeev Khanna F. Bruce Shepherd

Published in: STOC (2006)

Keyphrases

disjoint paths
planar graphs
undirected graph
approximation algorithms
directed graph
minimum cost
spanning tree
connected components
graph structure
minimum weight
directed acyclic graph
special case
complex networks
binary images
minimum spanning tree