Partitioning into Sets of Bounded Cardinality

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 among the members of the family. Specifically, we give a simple combinatorial algorithm that counts perfect matchings in a given graph on n vertices in time O(poly(n)ϕn ), where

• Type: Conference
• Year: 2009
• Where: IWPEC
• Authors: Mikko Koivisto
• Keywords: Applied Computing, IWPEC 2009, N-element Set, Set Family, Simple Combinatorial Algorithm