Counting or producing all fixed cardinality transversals

DOI10.1007/S00453-012-9716-5zbMATH Open1303.05200arXiv1106.0141OpenAlexW2032626793MaRDI QIDQ472469FDOQ472469

Authors: Marcel Wild 

Publication date: 19 November 2014

Published in: Algorithmica (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1106.0141

zbMATH Keywords

hitting setBell numberhypergraph transversalfixed cardinality

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Bell and Stirling numbers (11B73) Enumeration in graph theory (05C30) Hypergraphs (05C65) Transversal (matching) theory (05D15)

Cites Work

• Title not available (Why is that?)
• Computational aspects of monotone dualization: a brief survey
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
• Computing the output distribution and selection probabilities of a stack filter from the DNF of its positive Boolean function
• Compactly generating all satisfying truth assignments of a Horn formula
• Counting or producing all fixed cardinality transversals
• Coupon collecting and transversals of hypergraphs

Cited In (4)

• Compression with wildcards: Abstract simplicial complexes
• Title not available (Why is that?)
• Counting or producing all fixed cardinality transversals
• Compression with wildcards: all exact or all minimal hitting sets

Uses Software

• Mathematica
• OEIS

This page was built for publication: Counting or producing all fixed cardinality transversals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q472469)