3471 search results - page 55 / 695 » Obstacle Numbers of Graphs |
IWOCA
2009
Springer
14 years 3 months ago
2009
Springer
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...
STACS
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
ADHOCNOW
2004
Springer
14 years 2 months ago
2004
Springer
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
IROS
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract— Path deformation is a technique that was introduced to generate robot motion wherein a path, that has been computed beforehand, is continuously deformed on-line in resp...
ICRA
2006
IEEE
14 years 3 months ago
2006
IEEE
— This paper addresses the problem of maneuvering an object by pushing it through an environment with obstacles. Instead of only pushing the object through open spaces, we also a...