Pages that link to "Item:Q3569091"
From MaRDI portal
The following pages link to Maximum Independent Set in Graphs of Average Degree at Most Three in ${\mathcal O}(1.08537^n)$ (Q3569091):
Displaying 5 items.
- Parameterized edge dominating set in graphs with degree bounded by 3 (Q388085) (← links)
- A refined algorithm for maximum independent set in degree-4 graphs (Q1680494) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- Fast algorithms for max independent set (Q2428670) (← links)
- Parameterized Edge Dominating Set in Cubic Graphs (Q3004660) (← links)
