Pages that link to "Item:Q3404455"
From MaRDI portal
The following pages link to A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs (Q3404455):
Displaying 7 items.
- Parameterized edge dominating set in graphs with degree bounded by 3 (Q388085) (← links)
- New parameterized algorithms for the edge dominating set problem (Q392035) (← links)
- An exact algorithm for maximum independent set in degree-5 graphs (Q896662) (← links)
- A refined algorithm for maximum independent set in degree-4 graphs (Q1680494) (← links)
- Exact algorithms for maximum independent set (Q2013558) (← links)
- Parameterized Edge Dominating Set in Cubic Graphs (Q3004660) (← links)
- On the Independence Number of Graphs with Maximum Degree 3 (Q3104780) (← links)