Pages that link to "Item:Q4736814"
From MaRDI portal
The following pages link to Exact algorithms for finding minimum transversals in rank-3 hypergraphs (Q4736814):
Displayed 9 items.
- A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (Q414887) (← links)
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction (Q820146) (← links)
- A top-down approach to search-trees: Improved algorithmics for 3-hitting set (Q848640) (← links)
- Parameterized algorithms for \(d\)-hitting set: the weighted case (Q964386) (← links)
- A bounded search tree algorithm for parameterized face cover (Q1002098) (← links)
- Improved algorithms for the general exact satisfiability problem (Q2232607) (← links)
- A Faster Algorithm for Dominating Set Analyzed by the Potential Method (Q2891336) (← links)
- On sets of integers which contain no three terms in geometric progression (Q5501150) (← links)
- Faster graph coloring in polynomial space (Q5925619) (← links)