Counting or producing all fixed cardinality transversals

DOI10.1007/s00453-012-9716-5zbMath1303.05200arXiv1106.0141OpenAlexW2032626793MaRDI QIDQ472469

Marcel Wild

Publication date: 19 November 2014

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

Bell numberhitting sethypergraph transversalfixed cardinality

Mathematics Subject Classification ID

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

Related Items (3)

Compression with wildcards: all exact or all minimal hitting sets ⋮ Compression with wildcards: Abstract simplicial complexes ⋮ Counting or producing all fixed cardinality transversals

Uses Software

• Mathematica
• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Counting or producing all fixed cardinality transversals
• 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

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