An approximation algorithm for the maximum independent set problem in cubic planar graphs
Elarbi Choukhmane, John V. Franco · Networks · 1986
Abstract A polynomial time approximation algorithm A for the problem of finding a maximal independent set for cubic planar graphs is presented. It is shown that MA > 6/7 in the case of cubic planar graphs and MA = 7/8 in the case of triangle free cubic planar graphs where MA is the worst‐case ratio of the size of the independent set found by A to the size of the maximum independent set for the graph input to A.