281 search results - page 15 / 57 » Better Polynomial Algorithms on Graphs of Bounded Rank-Width |
TVCG
2010
13 years 5 months ago
2010
—We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existin...
COLOGNETWENTE
2007
13 years 8 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
COLT
1993
Springer
13 years 11 months ago
1993
Springer
In this paper we demonstrate how weighted majority voting with multiplicative weight updating can be applied to obtain robust algorithms for learning binary relations. We first pre...
DAM
1999
13 years 7 months ago
1999
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
AMAI
2004
Springer
14 years 24 days ago
2004
Springer
We study three new techniques which will speed up the branch-and-bound algorithm for the MAX-2-SAT problem: The first technique is a new lower bound function for the algorithm an...