An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs
- 1 November 1982
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 11 (4) , 663-675
- https://doi.org/10.1137/0211055
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- A linear 5-coloring algorithm of planar graphsJournal of Algorithms, 1981
- Every planar map is four colorable. Part I: DischargingIllinois Journal of Mathematics, 1977
- Efficient Planarity TestingJournal of the ACM, 1974
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969