2 search results - page 1 / 1 » Fast computation of empirically tight bounds for the diamete... |
JEA
2008
13 years 4 months ago
2008
CIAC
2000
Springer
13 years 9 months ago
2000
Springer
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 ...