39 search results - page 1 / 8 » Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs |
CORR
2008
Springer
13 years 5 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...
ATMOS
2010
13 years 4 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
ISAAC
2009
Springer
13 years 10 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...
CORR
2012
Springer
12 years 1 months ago
2012
Springer
Let G be a directed graph with n vertices and non-negative weights in its directed edges, embedded on a surface of genus g, and let f be an arbitrary face of G. We describe an alg...
FCT
1995
Springer
13 years 9 months ago
1995
Springer
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...