109 search results - page 4 / 22 » Edge-Disjoint Paths in Planar Graphs |
CORR
2012
Springer
12 years 3 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...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
In joint work with ´Eva Tardos in 1995, we asked whether it was possible to obtain a polynomial-time, polylogarithmic approximation algorithm for the disjoint paths problem in th...
GD
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We consider the problem of simultaneous embedding of planar graphs. We demonstrate how to simultaneously embed a path and an n-level planar graph and how to use radial em...
CORR
1999
Springer
13 years 7 months ago
1999
Springer
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
