2766 search results - page 134 / 554 » Algorithms for trigonometric polynomials |
156
click to vote
NETWORKS
2006
15 years 4 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
130
click to vote
ISSAC
2009
Springer
15 years 10 months ago
2009
Springer
The computation of triangular decompositions involves two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new...
129
click to vote
GC
2008
Springer
15 years 4 months ago
2008
Springer
Gioan showed that the number of cycle reversing classes of totally cyclic orientations of a given graph can be calculated as an evaluation of the corresponding Tutte polynomial. We...
148
click to vote
JCP
2006
15 years 4 months ago
2006
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
134
click to vote
ALGORITHMICA
2005
15 years 4 months ago
2005
We present polynomial upper and lower bounds on the number of iterations performed by the k-means method (a.k.a. Lloyd's method) for k-means clustering. Our upper bounds are ...