7 search results - page 1 / 2 » A Distributed Algorithm for Finding All Best Swap Edges of a... |
WDAG
2007
Springer
13 years 10 months ago
2007
Springer
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
ESA
1998
Springer
13 years 8 months ago
1998
Springer
CIAC
2000
Springer
13 years 8 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 ...
IJCM
2002
13 years 4 months ago
2002
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...
JCB
2002
13 years 4 months ago
2002
This paper investigates the standard ordinary least-squares version 24 and the balanced version 20 of the minimum evolution principle. For the standard version, we provide a greedy...