Compression with wildcards: all exact or all minimal hitting sets

DOI10.1515/math-2022-0596zbMath1523.05032arXiv2008.08996OpenAlexW3074795165MaRDI QIDQ6083242

Marcel Wild

Publication date: 31 October 2023

Published in: Open Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

vertical layoutcompressed enumerationhitting set (minimal, minimum, exact)

Mathematics Subject Classification ID

Hypergraphs (05C65) Enumeration in graph theory (05C30) Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Counting or producing all fixed cardinality transversals
• NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems
• Exact transversal hypergraphs and application to Boolean \(\mu\)-functions
• Efficient algorithms for dualizing large-scale hypergraphs
• The Minimal Hitting Set Generation Problem: Algorithms and Computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Compression with wildcards: all exact or all minimal hitting sets