Pages that link to "Item:Q835007"
From MaRDI portal
The following pages link to Refined memorization for vertex cover (Q835007):
Displayed 9 items.
- Improved upper bounds for vertex cover (Q708228) (← links)
- Exact algorithms and applications for tree-like Weighted Set Cover (Q866547) (← links)
- Enumerate and expand: Improved algorithms for connected vertex cover and tree cover (Q929296) (← links)
- A bounded search tree algorithm for parameterized face cover (Q1002098) (← links)
- On two techniques of combining branching and treewidth (Q1022343) (← links)
- On parameterized exponential time complexity (Q1029333) (← links)
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
- An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} (Q2429350) (← links)
- Minimum Leaf Out-Branching Problems (Q3511432) (← links)