3008 search results - page 222 / 602 » Independence in connected graphs |
156
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Graphs are called navigable if one can find short paths through them using only local knowledge. It has been shown that for a graph to be navigable, its construction needs to mee...
167
Voted
APPROX
2004
Springer
16 years 21 hour ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
207
click to vote
COMPGEOM
1992
ACM
15 years 10 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
128
click to vote
ICRA
2007
IEEE
16 years 28 days ago
2007
IEEE
— Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This is important because communicat...
167
click to vote
BC
2005
15 years 6 months ago
2005
Abstract We study the influence of spatially correlated noise on the transient dynamics of a recurrent network with Mexican-Hat type connectivity. We derive the closed form of the ...