A Lower Bound for the HBC Transversal Hypergraph Generation

DOI10.3233/FI-2014-997MaRDI QIDQ5416742zbMATH OpenOpenAlexFDO

Authors Matthias Hagen, Imran Rauf, Khaled 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

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

Recommendations

• Lower bounds for three algorithms for transversal hypergraph generation
• Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation
• An Efficient Algorithm for the Transversal Hypergraph Generation
• scientific article; zbMATH DE number 7666858
• A note on improved upper bounds on the transversal number of hypergraphs
• Bounds on upper transversals in hypergraphs
• scientific article; zbMATH DE number 1670855
• Dual-bounded generating problems: Partial and multiple transversals of a hypergraph
• An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals
• Total transversals in hypergraphs and their applications

Cited in

(4)

• Lower bounds for three algorithms for transversal hypergraph generation
• The minimal hitting set generation problem: algorithms and computation
• Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation
• An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation

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

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