3471 search results - page 9 / 695 » Obstacle Numbers of Graphs |
GD
2005
Springer
14 years 1 months ago
2005
Springer
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
ICRA
2009
IEEE
14 years 2 months ago
2009
IEEE
— We consider the problem of tracking multiple agents moving amongst obstacles, using multiple cameras. Given an environment with obstacles, and many people moving through it, we...
ICRA
2003
IEEE
14 years 1 months ago
2003
IEEE
We present an online algorithm for planning sequences of footstep locations that encode goal-directed navigation strategies for humanoid robots. Planning footsteps is more general...
JGT
2006
13 years 7 months ago
2006
This paper studies the circular chromatic number of a class of circular partitionable graphs. We prove that an infinite family of circular partitionable graphs have
ARSCOM
2004
13 years 7 months ago
2004
The domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular g...