3471 search results - page 99 / 695 » Obstacle Numbers of Graphs |
IROS
2006
IEEE
14 years 3 months ago
2006
IEEE
— This paper offers a path planning algorithm based on splines. The sought path avoids the obstacles, and is smooth and short. Smoothing is used as an integral part of the algori...
COMPGEOM
2007
ACM
14 years 1 months ago
2007
ACM
We present a data structure for answering approximate shortest path queries in a planar subdivision from a fixed source. Let 1 be a real number. Distances in each face of this sub...
EJC
2008
13 years 9 months ago
2008
Let denote a distance-regular graph with classical parameters (D, b, , ) and D 3. Assume the intersection numbers a1 = 0 and a2 = 0. We show is 3-bounded in the sense of the ar...
TCS
2008
13 years 9 months ago
2008
Graph searching encompasses a wide variety of combinatorial problems related to the problem of capturing a fugitive residing in a graph using the minimum number of searchers. In t...
DAM
2000
13 years 9 months ago
2000
We prove that there is no cubic graph with diameter 4 on 40 vertices. This implies that the maximal number of vertices of a (3,4)-graph is 38. ? 2000 Elsevier Science B.V. All rig...