22 search results - page 1 / 5 » iwpec 2009 |
73
Voted
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
77
Voted
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
55
Voted
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
IWPEC
2009
Springer
15 years 4 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 ...
IWPEC
2009
Springer
15 years 4 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...