4865 search results - page 586 / 973 » The Complexity of Graph Connectivity |
190
click to vote
TCOM
2010
15 years 5 months ago
2010
Abstract— Today, due to the vast amount of literature on largescale wireless networks, we have a fair understanding of the asymptotic behavior of such networks. However, in real ...
192
click to vote
SIAMDM
2010
15 years 1 months ago
2010
The domination game played on a graph G consists of two players, Dominator and Staller who alternate taking turns choosing a vertex from G such that whenever a vertex is chosen by...
199
click to vote
MOBIHOC
2007
ACM
16 years 6 months ago
2007
ACM
Disruption-Tolerant Networks (DTNs) deliver data in network environments composed of intermittently connected nodes. Just as in traditional networks, malicious nodes within a DTN ...
183
click to vote
SIGGRAPH
1995
ACM
15 years 10 months ago
1995
ACM
In computer graphics and geometric modeling, shapes are often represented by triangular meshes. With the advent of laser scanning systems, meshes of extreme complexity are rapidly...
195
click to vote
DIALM
2010
ACM
15 years 4 months ago
2010
ACM
We present a method for using real world mobility traces to identify tractable theoretical models for the study of distributed algorithms in mobile networks. We validate the metho...