641 search results - page 42 / 129 » On Planar Quasi-Parity Graphs |
ISAAC
2005
Springer
15 years 7 months ago
2005
Springer
Given a set S of n points in RD , and an integer k such that 0 k < n, we show that a geometric graph with vertex set S, at most n − 1 + k edges, maximum degree five, and dila...
112
click to vote
GD
2006
Springer
15 years 5 months ago
2006
Springer
We consider the problem of intersection-free planar graph morphing, and in particular, a generalization from Euclidean space to spherical space. We show that there exists a continu...
113
click to vote
FSTTCS
2000
Springer
15 years 5 months ago
2000
Springer
We present a new scheme for storing a planar graph in external memory so that any online path can be traversed in an I-O efficient way. Our storage scheme significantly improves th...
120
click to vote
COMBINATORICS
2004
15 years 1 months ago
2004
The set of all orientations of a planar graph with prescribed outdegrees carries the structure of a distributive lattice. This general theorem is proven in the first part of the p...
134
click to vote
MFCS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....