641 search results - page 96 / 129 » On Planar Quasi-Parity Graphs |
SODA
2012
ACM
13 years 9 days ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
CORR
2008
Springer
14 years 10 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 ...
FCT
1995
Springer
15 years 1 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...
APPINF
2003
14 years 11 months ago
2003
In this paper we present optimum interval routing algorithms for message passing networks that have topological structure defined by k-caterpillars and maximal outer planar graph...
ICCV
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper, we present an attribute graph grammar for image parsing on scenes with man-made objects, such as buildings, hallways, kitchens, and living rooms. We choose one clas...