On the maximum independent set problem in subclasses of planar graphs

Journal of Graph Algorithms and Applications

Volumn 14, Issue 2, 2010, Pages 269-286

  Lozin, Vadim ^a   Milanič, Martin ^b  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b UNIVERSITY OF PRIMORSKA   (Slovenia)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; SET THEORY;

INDEPENDENT SET PROBLEMS; INDUCED PATHS; MAXIMUM INDEPENDENT SETS; NP-HARD; PLANAR GRAPH; POLYNOMIALLY SOLVABLE;

GRAPHIC METHODS;

EID: 85000512645     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00207     Document Type: Article

References (23)

1. V. Alekseev. The effect of local constraints on the complexity of determina-tion of the graph independence number. In Combinatorial-algebraic meth-ods in applied mathematics, pages 3-13. Gorkiy University Press, Gorky, 1982.
2. V. Alekseev. On easy and hard hereditary classes of graphs with respect to the independent set problem. Stability in graphs and related topics. Discrete Appl. Math., 132:17-26, 2003.
3. V. Alekseev. A polynomial algorithm for finding the largest independent sets in fork-free graphs. Discrete Appl. Math., 135:3-16, 2004.
4. S. Arnborg and A. Proskurowski. Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl. Math., 23:11-24, 1989.
5. D. Corneil, Y. Perl, and L. Stewart. A linear recognition algorithm for cographs. SIAM J. Comput., 14:926-934, 1985.
6. E. Demaine and M. Hajiaghayi. Diameter and treewidth in minor-closed graph families, revisited. Algorithmica, 40:211-215, 2004.
7. G. Dirac. On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg, 25:71-76, 1961.
8. D. Eppstein. Diameter and treewidth in minor-closed graph families. Al-gorithmica, 27:275-291, 2000.
9. M. Garey and D. Johnson. The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math., 32:826-834, 1977.
10. M. Gerber, A. Hertz, and V. Lozin. Augmenting chains in graphs without a skew star. J. Comb. Theory, Ser. B, 96:352-366, 2006.
11. F. Hadlock. Finding a maximum cut of a planar graph in polynomial time. SIAM J. Comput., 4:221-225, 1975.
12. P. Hall. On representatives of subsets. J. London Math. Soc., 10:26-30, 1935.
13. C. Heckman and R. Thomas. Independent sets in triangle-free cubic planar graphs. J. Combin. Theory Ser. B, 96:253-275, 2006.
14. W.-L. Hsu. The coloring and maximum independent set problems on planar perfect graphs. J. Assoc. Comput. Mach., 35:535-5632, 1988.
15. L. Lovász and M. Plummer. Matching theory. North-Holland Mathematics Studies, 121. Annals of Discrete Mathematics, 29. North-Holland Publish-ing Co., Amsterdam; Akad´emiai Kiad´o (Publishing House of the Hungarian Academy of Sciences), Budapest, 1986. xxvii+544 pp.
16. V. Lozin and M. Milanič. On finding augmenting graphs. Discrete Appl. Math., 156:2517-2529, 2008.
17. V. Lozin and R. Mosca. Independent sets in extensions of 2K2-free graphs. Discrete Appl. Math., 146:74-80, 2005.
18. C. V. Madhavan. Approximation algorithm for maximum independent set in planar triangle-free graphs. In Foundations of software technology and theoretical computer science (Bangalore, 1985), volume 181 of Lecture Notes in Comput. Sci., pages 381-392. Springer, Berlin, 1984.
19. G. Minty. On maximal independent sets of vertices in claw-free graphs. J. Combin. Theory Ser. B, 28:284-304, 1980.
20. S. Poljak. A note on stable sets and coloring of graphs. Comment. Math. Univ. Carolinae, 15:307-309, 1974.
21. N. Sbihi. Algorithme de recherche d’un stable de cardinalité maximum dans un graphe sans étoile. Discrete Math., 29:53-76, 1980.
22. R. Tarjan. Decomposition by clique separators. Discrete Math., 55:221-232, 1985.
23. S. Whitesides. An algorithm for finding clique cut-sets. Inform. Process. Lett., 12:31-32, 1981.