Congestion in planar graphs with demands on faces

Guyslain Naves (1) , Christophe Weibel (1, 2)

1 Department of Mathematics and Statistics [Montréal]
2 Department of Computer Science

We give an algorithm to route a multicommodity flow in a planar graph $G$ with congestion $O(\log k)$, where $k$ is the maximum number of terminals on the boundary of a face, when each demand edge lie on a face of $G$. We also show that our specific method cannot achieve a substantially better congestion.

Mots clés: multicommodity flows; edge-disjoint paths; congestion

Domaines: Mathématique discrète [cs.DM]

Guyslain Naves, Christophe Weibel. Congestion in planar graphs with demands on faces. 2010. ⟨hal-00510747⟩