22 search results - page 1 / 5 » iwpec 2009 |
115
Voted
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
89
Voted
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
115
Voted
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be labeled from 1 to n such that the labels of every pair of adjacent vertices differ by ...
107
click to vote
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We show that the partitions of an n-element set into k members of a given set family can be counted in time O((2− )n ), where > 0 depends only on the maximum size am...