A Lower Bound for the HBC Transversal Hypergraph Generation

DOI10.3233/FI-2014-997zbMath1359.68127OpenAlexW1784468336MaRDI QIDQ5416742

Matthias Hagen, Imran Rauf, Khaled M. Elbassioni

Publication date: 14 May 2014

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2014-997

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

The Minimal Hitting Set Generation Problem: Algorithms and Computation

This page was built for publication: A Lower Bound for the HBC Transversal Hypergraph Generation