Pages that link to "Item:Q3787812"
From MaRDI portal
The following pages link to An approximation algorithm for the maximum independent set problem in cubic planar graphs (Q3787812):
Displaying 7 items.
- The maximal \(f\)-dependent set problem for planar graphs is in NC (Q673069) (← links)
- The maximum clique problem (Q1318271) (← links)
- Some APX-completeness results for cubic graphs (Q1566710) (← links)
- A linear time algorithm for finding a maximum independent set of a fullerene (Q2364862) (← links)
- Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs (Q2958319) (← links)
- The maximum independent set problem for cubic planar graphs (Q3834072) (← links)
- Classes of subcubic planar graphs for which the independent set problem is polynomially solvable (Q5263816) (← links)