Maximum edge-disjoint paths in planar graphs with congestion 2.

Loïc Seguin-Charbonneau F. Bruce Shepherd

Published in: Math. Program. (2021)

Keyphrases

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