Exact algorithms for finding minimum transversals in rank-3 hypergraphs
From MaRDI portal
Publication:4736814
DOI10.1016/j.jalgor.2004.01.001zbMath1091.68083OpenAlexW1977514877MaRDI QIDQ4736814
Publication date: 6 August 2004
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgor.2004.01.001
Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction, A Faster Algorithm for Dominating Set Analyzed by the Potential Method, A top-down approach to search-trees: Improved algorithmics for 3-hitting set, A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between, Improved algorithms for the general exact satisfiability problem, Parameterized algorithms for \(d\)-hitting set: the weighted case, A bounded search tree algorithm for parameterized face cover, Faster graph coloring in polynomial space, On sets of integers which contain no three terms in geometric progression
