Pages that link to "Item:Q1026228"
From MaRDI portal
The following pages link to Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3 (Q1026228):
Displaying 14 items.
- On bipartization of cubic graphs by removal of an independent set (Q298966) (← links)
- An exact algorithm for maximum independent set in degree-5 graphs (Q896662) (← links)
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover (Q897878) (← links)
- A refined algorithm for maximum independent set in degree-4 graphs (Q1680494) (← links)
- Parameterized measure \& conquer for problems with no small kernels (Q1759684) (← links)
- Exact algorithms for maximum independent set (Q2013558) (← links)
- Above guarantee parameterization for vertex cover on graphs with maximum degree 4 (Q2111076) (← links)
- A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
- Fast algorithms for max independent set (Q2428670) (← links)
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q2946427) (← links)
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q4588848) (← links)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
- 3-Hitting set on bounded degree hypergraphs: Upper and lower bounds on the kernel size (Q5261045) (← links)
- Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs (Q6492080) (← links)
