Counting or producing all fixed cardinality transversals
Discrete Mathematics
2017-03-01 v2 Combinatorics
Abstract
An algorith to count, or alternatively generate, all k-element transversals of a set system is presented and compared with three known methods. For special cases it works in output-linear time.
Cite
@article{arxiv.1106.0141,
title = {Counting or producing all fixed cardinality transversals},
author = {Marcel Wild},
journal= {arXiv preprint arXiv:1106.0141},
year = {2017}
}
Comments
This improves upon the previous version, and is to appear (with identical content) in Algorithmica