An approximation algorithm for the maximum independent set problem in cubic planar graphs
- 1 December 1986
- Vol. 16 (4), 349-356
- https://doi.org/10.1002/net.3230160402
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- An Approximation Algorithm for the Maximum Independent Set Problem on Planar GraphsSIAM Journal on Computing, 1982
- Extremal bipartite subgraphs of cubic triangle-free graphsJournal of Graph Theory, 1982
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- Finding a Maximum Cut of a Planar Graph in Polynomial TimeSIAM Journal on Computing, 1975