217 search results - page 1 / 44 » Constructing Incremental Sequences in Graphs |
AOR
2006
13 years 11 months ago
2006
JOIN
2007
13 years 11 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
IJRR
2000
13 years 11 months ago
2000
This paper prescribes an incremental procedure to construct roadmaps of unknown environments. Recall that a roadmap is a geometric structure that a robot uses to plan a path betwe...
COMPGEOM
2009
ACM
14 years 5 months ago
2009
ACM
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
AHSWN
2008
13 years 11 months ago
2008
Given a graph G, a k-dominating set of G is a subset S of its vertices with the property that every vertex of G is either in S or has at least k neighbors in S. We present a new i...