3 search results - page 1 / 1 » Congestion in planar graphs with demands on faces |
39
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
156
Voted
FOCS
2004
IEEE
15 years 5 months ago
2004
IEEE
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...
121
Voted
STOC
2006
ACM
16 years 2 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...