Abstract
AbstractA 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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
