68 search results - page 11 / 14 » Diameter and connectivity of 3-arc graphs |
SOFSEM
1997
Springer
13 years 11 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
—In this paper, we conduct extensive simulations to understand the properties of the overlay generated by BitTorrent. We start by analyzing how the overlay properties impact the ...
INFOCOM
2003
IEEE
14 years 25 days ago
2003
IEEE
— We analyze the susceptibility of the Internet to random faults, malicious attacks, and mixtures of faults and attacks. We analyze actual Internet data, as well as simulated dat...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We present a distributed clock synchronization algorithm that guarantees an exponentially improved bound of O(log D) on the clock skew between neighboring nodes in any graph G of ...
WADS
2005
Springer
14 years 1 months ago
2005
Springer
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a spannin...