10 search results - page 2 / 2 » mst 1998 |
112
Voted
IPL
1998
15 years 23 days ago
1998
The k-MST problem requires ï¬nding 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...
111
Voted
FSTTCS
2007
Springer
15 years 7 months ago
2007
Springer
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b 2. The aim is to nd a minimum weight spannin...
98
Voted
MST
1998
15 years 23 days ago
1998
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
106
Voted
MST
1998
15 years 23 days ago
1998
We consider the problem of merging two sorted sequences on constant degree networks using comparators only. The classical solution to the problem are the networks based on Batcherâ...
116
Voted
MST
1998
15 years 23 days ago
1998
We have developed a methodology for predicting the performance of parallel algorithms on real parallel machines. The methodology consists of two steps. First, we characterize a mac...