SIGN IN
SIGN UP
Energy-optimal distributed algorithms for minimum spanning trees
Full Text:
PDF
Buy this Article
Authors:
Yongwook Choi
Purdue University, West Lafayette, IN, USA
Maleq Khan
Virginia Tech, Blacksburg, VA, USA
V.S. Anil Kumar
Virginia Tech, Blacksburg, VA, USA
Gopal Pandurangan
Purdue University, West Lafayette, IN, USA
2008 Article
Bibliometrics
· Downloads (6 Weeks): 10
· Downloads (12 Months): 96
· Downloads (cumulative): 375
· Citation Count: 0
Published in:
· Proceeding
SPAA '08
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Pages 188-190
ACM
New York, NY
, USA
©2008
table of contents
ISBN: 978-1-59593-973-9
doi>
10.1145/1378533.1378569
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SPAA '13
Share:
|
Tags:
algorithms
computations on discrete structures
distributed algorithm
distributed approximation algorithm
energy-efficient
graph algorithms
minimum spanning tree
theory
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