829 search results - page 54 / 166 » Distance domination-critical graphs |
IMA
2001
Springer
15 years 4 months ago
2001
Springer
A recursive construction is provided for sequence sets which possess good Hamming Distance and low Peak-to-Average Power Ratio (PAR) under any Local Unitary Unimodular Transform. W...
IPPS
1999
IEEE
15 years 4 months ago
1999
IEEE
This paper proposes a method for reducing the maximum degree of vertices in graphs that maintain optimal broadcast time when a vertex can call a vertex at distance at most k durin...
IJRR
2000
14 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...
135
click to vote
CDC
2010
IEEE
14 years 6 months ago
2010
IEEE
In this paper, we consider a multi-agent system consisting of mobile agents with second-order dynamics. The communication network is determined by a standard interaction rule based...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We present fast algorithms for constructing probabilistic embeddings and approximate distance oracles in sparse graphs. The main ingredient is a fast algorithm for sampling the pr...