4 citations · 17 across the 11 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.DM2010
Congestion in planar graphs with demands on faces
Guyslain Naves, Christophe Weibel
We give an algorithm to route a multicommodity flow in a planar graph with congestion , where is the maximum number of terminals on the boundary of a face, when…
cs.DM2010
On disjoint paths in acyclic planar graphs
Guyslain Naves
We give an algorithm with complexity for the integer multiflow problem on instances with an acyclic planar digraph and Eulerian. Here, $…