109 search results - page 6 / 22 » Edge-Disjoint Paths in Planar Graphs |
ISAAC
2009
Springer
15 years 4 months ago
2009
Springer
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
109
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We provide the first linear-space data structure with provable sublinear query time for exact point-topoint shortest path queries in planar graphs. We prove that for any planar gr...
101
click to vote
STOC
2006
ACM
15 years 12 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...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t be two distinct faces of G; let s1, . . . , sk be vertices incident wi...
ALGORITHMICA
2006
14 years 11 months ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...