An approximation algorithm for the maximum independent set problem in cubic planar graphs

Publisher Website

1 December 1986

journal article
research article
Published by Wiley in Networks

Vol. 16 (4) , 349-356
https://doi.org/10.1002/net.3230160402

Abstract

No abstract available

Keywords

This publication has 4 references indexed in Scilit:

Some simplified NP-complete graph problems
Published by Elsevier ,2002
An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs
SIAM Journal on Computing, 1982
Extremal bipartite subgraphs of cubic triangle‐free graphs
Journal of Graph Theory, 1982
Finding a Maximum Cut of a Planar Graph in Polynomial Time
SIAM Journal on Computing, 1975