Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. M.O. ALBERTSON, Finding an independent set in planar graphs. In Graphs and Combinatorics, R.A. Bari and F. Harary, Eds. Springer, Berlin (1974) pp.173–179.
2. N. CHIBA, T. NISHIZEKI AND N. SAITO, A linear 5-coloring algorithm of planar graphs, J. Algorithms, 2(1981), pp.317–327.
3. N. CHIBA, T. NISHIZEKI AND N. SAITO, An algorithm for finding a large independent set in planar graphs, Networks 13(1983), pp. 247–252.
4. N. CHIBA, T. NISHIZEKI AND N. SAITO, An approximation algorithm for the maximum independent set problem on planar graphs, SIAM J.Comput., 11(1982), pp.663–675.
5. M.R. GAREY AND D.S. JOHNSON, Computers and Intractability: A guide to the theory of NP-completeness, W.H. Freeman, San Francisco, 1979.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Optimal space coverage with white convex polygons;Journal of Combinatorial Optimization;2014-12-09
2. Large Independent Sets in Triangle-Free Planar Graphs;Algorithms - ESA 2014;2014
3. White Space Regions;SOFSEM 2011: Theory and Practice of Computer Science;2011
4. Computational Aspects of Carbon and Boron Nanotubes;Molecules;2010-11-30
5. Kernelization for Cycle Transversal Problems;Algorithmic Aspects in Information and Management;2010