SIGN IN
SIGN UP
A Distributed Algorithm for Minimum-Weight Spanning Trees
Full Text:
PDF
Buy this Article
Authors:
R. G. Gallager
Room 35-206, Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA
P. A. Humblet
Room 35-203, Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA
P. M. Spira
Apple Computer Company, 10260 Bandley Drive, Cupertino, CA
Published in:
· Journal
ACM Transactions on Programming Languages and Systems (TOPLAS)
TOPLAS Homepage
archive
Volume 5 Issue 1, Jan. 1983
Pages 66-77
ACM
New York, NY
, USA
table of contents
doi>
10.1145/357195.357200
1983 Article
Bibliometrics
· Downloads (6 Weeks): 61
· Downloads (12 Months): 257
· Downloads (cumulative): 3,576
· Citation Count: 218
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
data types and structures
distributed networks
distributed systems
trees
trees
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