Pages that link to "Item:Q1680494"
From MaRDI portal
The following pages link to A refined algorithm for maximum independent set in degree-4 graphs (Q1680494):
Displaying 8 items.
- An improved exact algorithm for TSP in graphs of maximum degree 4 (Q255262) (← links)
- An exact algorithm for maximum independent set in degree-5 graphs (Q896662) (← links)
- Exact algorithms for maximum independent set (Q2013558) (← links)
- Above guarantee parameterization for vertex cover on graphs with maximum degree 4 (Q2111076) (← links)
- On the Power of Nodes of Degree Four in the Local Max-Cut Problem (Q3563008) (← links)
- Further Improvement on Maximum Independent Set in Degree-4 Graphs (Q5199148) (← links)
- An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs (Q5405918) (← links)
- Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs (Q6492080) (← links)