A new algorithm for the hypergraph transversal problem

DOI10.1007/11533719_78MaRDI QIDQ5716999zbMATH OpenOpenAlexFDO

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

Publication date 11 January 2006

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

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

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Recommendations

• An Efficient Algorithm for the Transversal Hypergraph Generation
• A global parallel algorithm for the hypergraph transversal problem
• Faster Algorithms to Enumerate Hypergraph Transversals
• Resolution based algorithms for the transversal hypergraph generation problem
• An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals
• Algorithms for finding clique-transversals of graphs
• Lower bounds for three algorithms for transversal hypergraph generation
• Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation
• scientific article; zbMATH DE number 7564191
• Total transversals in hypergraphs and their applications

Cited in

(32)

• Lower bounds for three algorithms for transversal hypergraph generation
• A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
• Dual-bounded generating problems: Weighted transversals of a hypergraph
• Affine planes and transversals in 3-uniform linear hypergraphs
• Bounds on upper transversals in hypergraphs
• Resolution based algorithms for the transversal hypergraph generation problem
• An average study of hypergraphs and their minimal transversals
• Upper transversals in hypergraphs
• Generating partial and multiple transversals of a hypergraph
• Faster Algorithms to Enumerate Hypergraph Transversals
• Incremental complexity of a bi-objective hypergraph transversal problem
• The minimal hitting set generation problem: algorithms and computation
• An Efficient Algorithm for the Transversal Hypergraph Generation
• Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation
• Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover
• Hypergraph transversal computation and related problems in logic and AI
• Exact algorithms for finding minimum transversals in rank-3 hypergraphs
• Identifying the Minimal Transversals of a Hypergraph and Related Problems
• scientific article; zbMATH DE number 7564191 (Why is no real title available?)
• About the structure of the blocker of the hyperplanes of a matroid
• A data mining formalization to improve hypergraph minimal transversal computation
• scientific article; zbMATH DE number 2230915 (Why is no real title available?)
• An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals
• Foundations of Information and Knowledge Systems
• An incremental algorithm for computing the transversal hypergraph
• Conformality of minimal transversals of maximal cliques
• Conformal hypergraphs: duality and implications for the upper clique transversal problem
• 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)
• Simplicial models of trace spaces

This page was built for publication: A new algorithm for the hypergraph transversal problem

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