829 search results - page 99 / 166 » Distance domination-critical graphs |
DCOSS
2005
Springer
15 years 5 months ago
2005
Springer
We present an efficient distributed data structure, called the D-SPANNER, for maintaining proximity information among communicating mobile nodes. The D-SPANNER is a kinetic sparse...
121
click to vote
ICRA
2000
IEEE
15 years 4 months ago
2000
IEEE
We present techniques for fast motion planning by using discrete approximations of generalized Voronoi diagrams, computed with graphics hardware. Approaches based on this diagram ...
JCO
2010
14 years 10 months ago
2010
Given a directed graph G = (N, A) with arc capacities uij and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacit...
TOSN
2010
14 years 10 months ago
2010
Boundary recognition is an important and challenging issue in wireless sensor networks when no coordinates or distances are available. The distinction between inner and boundary n...
OPODIS
2008
15 years 1 months ago
2008
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...