An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals

DOI10.1007/B13632MaRDI QIDQ5897277zbMATH OpenOpenAlexFDO

Authors Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Leonid G. Khachiyan

Publication date 3 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13632

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Nonnumerical algorithms (68W05)

Recommendations

• An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
• An Efficient Algorithm for the Transversal Hypergraph Generation
• Computing and Combinatorics
• Faster Algorithms to Enumerate Hypergraph Transversals
• scientific article; zbMATH DE number 1670855

Cited in

(19)

• A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
• Efficiently enumerating hitting sets of hypergraphs arising in data profiling
• Efficient algorithms for dualizing large-scale hypergraphs
• Algorithms for computing minimal unsatisfiable subsets of constraints
• Faster Algorithms to Enumerate Hypergraph Transversals
• Incremental complexity of a bi-objective hypergraph transversal problem
• An Efficient Algorithm for the Transversal Hypergraph Generation
• A Worst-Case Analysis of the Sequential Method to List the Minimal Hitting Sets of a Hypergraph
• Exact algorithms for finding minimum transversals in rank-3 hypergraphs
• Enumerating minimal transversals of hypergraphs without small holes
• Efficiently enumerating hitting sets of hypergraphs arising in data profiling
• Efficient algorithms for dualizing large-scale hypergraphs
• A Lower Bound for the HBC Transversal Hypergraph Generation
• Computing and Combinatorics
• An incremental algorithm for computing the transversal hypergraph
• A global parallel algorithm for the hypergraph transversal problem
• An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
• Computational aspects of monotone dualization: a brief survey
• Scientific contributions of Leo Khachiyan (a short overview)

This page was built for publication: An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals

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