Foundations of Information and Knowledge Systems

DOI10.1007/B95342MaRDI QIDQ5901856zbMATH OpenOpenAlexFDO

Authors Georg Gottlob

Publication date 14 May 2009

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

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

Mathematics Subject Classification ID

Hypergraphs (05C65) Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10) Logic in artificial intelligence (68T27)

Recommendations

• scientific article; zbMATH DE number 1931696
• Identifying the Minimal Transversals of a Hypergraph and Related Problems
• Dual-bounded generating problems: Partial and multiple transversals of a hypergraph
• Computing and Combinatorics
• scientific article; zbMATH DE number 1670855

Cited in

(10)

• Semi-hyper-connected vertex transitive graphs
• Counting minimal transversals of -acyclic hypergraphs
• A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
• Hypergraphs with large transversal number
• Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs
• Resolution based algorithms for the transversal hypergraph generation problem
• scientific article; zbMATH DE number 1931696 (Why is no real title available?)
• Identifying the Minimal Transversals of a Hypergraph and Related Problems
• A data mining formalization to improve hypergraph minimal transversal computation
• An approximation algorithm for submodular hitting set problem with linear penalties

This page was built for publication: Foundations of Information and Knowledge Systems

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