279 search results - page 39 / 56 » Degree-bounded minimum spanning trees |
123
click to vote
IPL
1998
15 years 1 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...
140
Voted
ICIP
1999
IEEE
16 years 3 months ago
1999
IEEE
This paper presents a toolbox for interactive image segmentation based on a series of nested partitions of increasing coarseness. The user can navigate among the different resolut...
ICPR
2006
IEEE
16 years 3 months ago
2006
IEEE
Graph-Spectral surface integration techniques construct an integration path assuming that the surface contains a path along which the integration error is minimal. This paper pres...
107
Voted
ESA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We present a software library Stxxl, that enables practiceoriented experimentation with huge data sets. Stxxl is an implementation of the C++ standard template library ST...
128
click to vote
COCOON
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...