Name
Abstract | ||
|---|---|---|
For n@?N, we consider the problem of partitioning the interval [0,n) into k subintervals of positive integer lengths @?"1,...,@?"k such that the lengths satisfy a set of simple constraints of the form @?"i@?"i"j@?"j where @?"i"j is one of , or =. In the full information case, @?"i"j is given for all 1= |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.jda.2006.10.004 | J. Discrete Algorithms |
Keywords | Field | DocType |
rhythm pattern,full information case,rhythm perception,integer sequences,modular arithmetic,simple constraint,subset-sum,k subintervals,positive integer length,realizing partition,integer partitions,partial order information,integer partition,integer sequence,subset sum,satisfiability,partial order | Integer,Discrete mathematics,Combinatorics,Subset sum problem,Of the form,Modular arithmetic,Partition (number theory),Mathematics,Integer sequence | Journal |
Volume | Issue | ISSN |
6 | 1 | Journal of Discrete Algorithms |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Erik D. Demaine | 1 | 4624 | 388.59 |
| Jeff Erickson | 2 | 1392 | 175.37 |
| Danny Krizanc | 3 | 1778 | 191.04 |
| Henk Meijer | 4 | 753 | 100.25 |
| Pat Morin | 5 | 1610 | 178.95 |
| Mark H. Overmars | 6 | 4572 | 518.80 |
| Sue Whitesides | 7 | 1449 | 197.63 |