641 search results - page 106 / 129 » On Planar Quasi-Parity Graphs |
APPROX
2005
Springer
14 years 3 months ago
2005
Springer
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...
WADS
2005
Springer
14 years 3 months ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
ICRA
2003
IEEE
14 years 3 months ago
2003
IEEE
This paper presents an algorithm, called PCG, for planning the foothold positions of spider-like robots in planar tunnels bounded by piecewise linear walls. The paper focuses on 3-...
IPPS
2002
IEEE
14 years 3 months ago
2002
IEEE
This paper addresses the problem of scatternet formation and maintenance for multi-hop Bluetooth based personal area and ad hoc networks with minimal communication overhead. Each ...
ICALP
2001
Springer
14 years 2 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...