1576 search results - page 10 / 316 » Streaming Algorithms for Independent Sets |
169
click to vote
WG
2004
Springer
15 years 7 months ago
2004
Springer
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
108
click to vote
JCT
2007
15 years 1 months ago
2007
Let G be a d-regular graph with girth g, and let α be the independence number of G. We show that α(G) ≥ 1 2 1 − (d − 1)−2/(d−2) − (g) n where (g) → 0 as g → ∞,...
115
click to vote
GBRPR
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...
105
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
We study the mixing time of the Glauber dynamics for general spin systems on bounded-degree trees, including the Ising model, the hard-core model (independent sets) and the antife...
105
Voted
ALGORITHMICA
2010
15 years 1 months ago
2010
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...