Sciweavers

2 search results - page 1 / 1
» Random-tree Diameter and the Diameter-constrained MST
Sort
View
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
13 years 8 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla
IJCM
2002
92views more  IJCM 2002»
13 years 4 months ago
Random-tree Diameter and the Diameter-constrained MST
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
Ayman Abdalla, Narsingh Deo