82 search results - page 6 / 17 » mst 2006 |
JPDC
2006
13 years 7 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
DC
2006
13 years 7 months ago
2006
IPL
1998
13 years 7 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
IJCM
2002
13 years 7 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...
MST
2006
13 years 7 months ago
2006
We study a popular pencil-and-paper game called morpion solitaire. We present upper and lower bounds for the maximum score attainable for many versions of the game. We also show t...