3 search results - page 1 / 1 » mis 2011 |
PODC
2011
ACM
12 years 7 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
MIS
2011
Springer
12 years 11 months ago
2011
Springer
By exchanging events in a vehicular ad hoc network (VANET), drivers can receive information that allows them to find relevant places (e.g., parking spaces) or avoid dangerous/unde...
PODC
2011
ACM
12 years 7 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...