140 search results - page 10 / 28 » On simultaneous planar graph embeddings |
JGAA
2006
13 years 6 months ago
2006
Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the v...
DM
2007
13 years 6 months ago
2007
In this paper it is shown that a class of almost-median graphs that includes all planar almost-median graphs can be recognized in O(m log n) time, where n denotes the number of ve...
CVPR
1999
IEEE
14 years 8 months ago
1999
IEEE
Traditional plane alignment techniques are typically performed between pairs of frames. In this paper we present a method for extending existing two-frame planar-motion estimation...
STACS
2009
Springer
14 years 1 months ago
2009
Springer
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...