1633 search results - page 79 / 327 » Planar Map Graphs |
93
Voted
ICIP
2009
IEEE
16 years 3 months ago
2009
IEEE
This paper addresses the problem of mapping images between different vision sensors. Such a mapping could be modeled as a sampling problem that has to encompass the change of geom...
146
Voted
ECCC
2007
15 years 2 months ago
2007
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...
149
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
115
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We study the ratio between the minimum size of an odd cycle vertex transversal and the maximum size of a collection of vertex-disjoint odd cycles in a planar graph. We show that th...
111
click to vote
AAIM
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We present new kernelization results for the s-cycle transversal problem for s > 3. In particular, we show a 6k2 kernel for 4-cycle transversal and a O(ks−1 ) kernel...