52 search results - page 7 / 11 » Minimum Connected Dominating Sets of Random Cubic Graphs |
97
Voted
SIAMDM
2010
14 years 8 months ago
2010
A set of vertices C in a graph is convex if it contains all vertices which lie on shortest paths between vertices in C. The convex hull of a set of vertices S is the smallest conve...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We study Maker-Breaker games played on the edge set of a random graph. Specifically, we consider the random graph process and analyze the first time in a typical random graph proc...
SNPD
2007
14 years 11 months ago
2007
Source and destination location privacy is a challenging and important problem in sensor networks. Nevertheless, privacy preserving communication in sensor networks is still a vir...
101
click to vote
ACMSE
2007
ACM
15 years 1 months ago
2007
ACM
Network wide broadcasting in ad-hoc wireless networks provides important control and route establishment functionality for a number of unicast and multicast protocols. In broadcas...
107
click to vote
FSTTCS
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...