3008 search results - page 72 / 602 » Independence in connected graphs |
182
click to vote
INFOCOM
2007
IEEE
16 years 18 days ago
2007
IEEE
— Recently, research on disconnected networks has been fostered by several studies on delay-tolerant networks, which are designed in order to sustain disconnected operations. We ...
165
click to vote
SPAA
2005
ACM
15 years 12 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
153
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
145
click to vote
CDC
2008
IEEE
16 years 23 days ago
2008
IEEE
— In this paper we examine the leader-to-follower ratio needed to maintain connectivity in a leader-follower multiagent network with proximity based communication topology. In th...
144
click to vote
WG
2001
Springer
15 years 10 months ago
2001
Springer
In this work we introduce, characterize, and provide algorithmic results for (k, +)–distance-hereditary graphs, k ≥ 0. These graphs can be used to model interconnection networ...