Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
Authors:
- 14 February 2000
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 17-31
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Multicasting in a linear lightwave network2002
- A tree-based distributed algorithm for the K-entry critical section problem2002
- Constrained spanning tree problems: Approximate methods and parallel computation1998
- An empirical assessment of algorithms for constructing a miminum spanning tree1994
- A note on Raymond's tree based algorithm for distributed mutual exclusionInformation Processing Letters, 1992
- A tree-based algorithm for distributed mutual exclusionACM Transactions on Computer Systems, 1989