320 search results - page 39 / 64 » Parity Problems in Planar Graphs |
ICALP
2009
Springer
14 years 9 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...
COCOON
2005
Springer
14 years 2 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
GBRPR
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Image segmentation has long been an important problem in the computer vision community. In our recent work we have addressed the problem of texture segmentation, where we...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
ISAAC
2007
Springer
14 years 3 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...