142 search results - page 1 / 29 » Network failure detection and graph connectivity |
SODA
2004
ACM
13 years 6 months ago
2004
ACM
STOC
2010
ACM
13 years 9 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
ISCC
2009
IEEE
13 years 11 months ago
2009
IEEE
It is important to have continuous connectivity in a wireless sensor network after it is deployed in a hostile environment. However, such networks are constrained by the low usert...
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
Studies of the fault-tolerance of graphs have tended to largely concentrate on classical graph connectivity. This measure is very basic, and conveys very little information for des...
SIGMETRICS
2005
ACM
13 years 10 months ago
2005
ACM
—To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users, this paper investigates the resilience of random graphs to li...