SIGN IN
SIGN UP
A simple improved distributed algorithm for minimum CDS in unit disk graphs
Full Text:
PDF
Buy this Article
Authors:
Stefan Funke
Stanford University, Saarbrücken, Germany
Alexander Kesselman
Max-Planck-Institut für Informatik, Saarbrücken, Germany
Ulrich Meyer
Max-Planck-Institut für Informatik, Saarbrücken, Germany
Michael Segal
Ben Gurion University, Beer-Sheva, Israel
2006 Article
Bibliometrics
· Downloads (6 Weeks): 7
· Downloads (12 Months): 35
· Downloads (cumulative): 837
· Citation Count: 12
Published in:
· Journal
ACM Transactions on Sensor Networks (TOSN)
TOSN Homepage
archive
Volume 2 Issue 3, August 2006
Pages 444-453
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1167935.1167941
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
algorithms
connected dominating set
geometrical problems and computations
theory
unit disk graphs
wireless communication
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder