1421 search results - page 27 / 285 » Algorithms for subsequence combinatorics |
COCOON
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...
COCOON
2009
Springer
15 years 4 months ago
2009
Springer
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O √ n · log n · log∗ n , that is, sublinear both in the size of th...
COMBINATORICS
1998
14 years 9 months ago
1998
A circulant graph G of order n is a Cayley graph over the cyclic group Zn. Equivalently, G is circulant iff its vertices can be ordered such that the corresponding adjacency matr...
COMBINATORICS
2006
14 years 9 months ago
2006
We present a variation of James Propp's generalized domino shuffling, which provides an efficient way to obtain perfect matchings of weighted Aztec diamonds. Our modification...
COMBINATORICS
2004
14 years 9 months ago
2004
In 1958, Richard Guy proved that the number of partitions of n into odd parts greater than one equals the number of partitions of n into distinct parts with no powers of 2 allowed...