Pages that link to "Item:Q3578312"

The following pages link to A Note on Vertex Cover in Graphs with Maximum Degree 3 (Q3578312):

Displaying 9 items.

• On a generalization of Nemhauser and Trotter's local optimization theorem (Q340561) (← links)
• Parameterized edge dominating set in graphs with degree bounded by 3 (Q388085) (← links)
• A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
• An exact algorithm for maximum independent set in degree-5 graphs (Q896662) (← links)
• Above guarantee parameterization for vertex cover on graphs with maximum degree 4 (Q2111076) (← links)
• A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
• Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q2946427) (← links)
• Parameterized Edge Dominating Set in Cubic Graphs (Q3004660) (← links)
• Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q4588848) (← links)