Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

110

Voted

IWPEC
2009
Springer

144views Applied Computing» more IWPEC 2009»

Partitioning into Sets of Bounded Cardinality

15 years 10 months ago

Partitioning into Sets of Bounded Cardinality

Download faculty.cs.tamu.edu

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. Speciﬁcally, we give a simple combinatorial algorithm that counts perfect matchings in a given graph on n vertices in time O(poly(n)ϕn ), where

Mikko Koivisto

Real-time Traffic

Applied Computing | IWPEC 2009 | N-element Set | Set Family | Simple Combinatorial Algorithm |

claim paper

Related Content

» Disjoint Partition and Intersection Constraints for Set and Multiset Variables

» Bounds on the metric and partition dimensions of a graph

» Lower bounds and heuristic algorithms for the k

» Enhancing set constraint solvers with lexicographic bounds

» Polynomial Constraints for Sets with Cardinality Bounds

» Tractable AnswerSet Programming with Weight Constraints Bounded Treewidth Is not Enough

» Fractional Collections with Cardinality Bounds and Mixed Linear Arithmetic with Stars

» Degree Bounded Spanning Trees

» Optimizing Algebraic Tableau Reasoning for SHOQ First Experimental Results

Post Info
More Details (n/a)

Added	27 May 2010
Updated	27 May 2010
Type	Conference
Year	2009
Where	IWPEC
Authors	Mikko Koivisto

Comments (0)