3471 search results - page 56 / 695 » Obstacle Numbers of Graphs |
ATAL
2008
Springer
13 years 11 months ago
2008
Springer
We present an algorithm that allows swarms of robots to navigate in environments containing unknown obstacles, moving towards and spreading along 2D shapes given by implicit funct...
EUROS
2008
13 years 11 months ago
2008
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 respon...
GD
2006
Springer
14 years 25 days ago
2006
Springer
The crossing number cr(G) of a graph G is the minimum number of crossings over all drawings of G in the plane. In 1993, Richter and Thomassen [RT93] conjectured that there is a co...
CCCG
1997
13 years 10 months ago
1997
In this paper we prove that for any simple polygon P with n vertices, the sum of the number of strictly internal edges and the number of strictly external visibility edges of P is...
APPML
2005
13 years 9 months ago
2005
Let the trunk of a graph G be the graph obtained by removing all leaves of G. We prove that, for every integer c 2, there are at most finitely many trunks of semiharmonic graphs ...