The steiner problem in distributed computing systems
References (23)
- et al.
A time-optimal messageefficient distributed algorithm for depth-first-search
Inform. Process. Lett.
(1987) - et al.
A fully distributed (minimal) spanning tree algorithm
Inform. Process. Lett.
(1986) Complexity of network synchronization
J. ACM
(Oct. 1985)Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems
- et al.
Dynamic deadlock resolution protocols
- et al.
An almost linear time and O(n log n + e) messages distributed algorithm for minimum-weight spanning trees
- et al.
A resilient distributed algorithm for minimum-weight spanning trees
A distributed algorithm for constructing minimal spanning trees
IEEE Trans. Software Eng.
(Mar. 1987)- et al.
Reserve path forwarding of broadcast packets
Comm. ACM
(Dec. 1978) Graph Theory with Applications to Engineering and Computer Science
(1974)
A note on two problems in connexion with graphs
Numer. Math.
(1959)
Cited by (0)
Copyright © 1993 Published by Elsevier Inc.