On easy and hard hereditary classes of graphs with respect to the independent set problem

Discrete Applied Mathematics

Volumn 132, Issue 1-3, 2003, Pages 17-26

  Alekseev, Vladimir E ^a  

^a LOBACHEVSKY STATE UNIVERSITY OF NIZHNY NOVGOROD   (Russian Federation)

Author keywords

Computational complexity; Hereditary class; Independent set problem

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

HEREDITARY CLASSES;

GRAPH THEORY;

EID: 0142061482     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00387-1     Document Type: Conference Paper

References (17)

1. Alekseev V.E. Hereditary classes and coding of graphs. Jablonskij S.V. Problems of Cybernetics. Vol. 39:1982;151-164 Nauka, Moscow. (in Russian).
2. V.E. Alekseev, On the local restrictions effect on the complexity of finding the graph independence number, in: A.A. Markov (Ed.), Combinatorial-Algebraic Methods in Applied Mathematics, Gorkiy University Press, Gorky, 1983, pp. 3-13 (in Russian).
3. V.E. Alekseev, On the number of maximal independence sets in graphs from hereditary classes, in: V.N. Shevchenko (Ed.), Combinatorial-Algebraic Methods in Applied Mathematics, Gorkiy University Press, Gorky, 1991, pp. 5-8 (in Russian).
4. Alekseev V.E. A polynomial algorithm for finding the largest independent sets in fork-free graphs. Discrete Anal. Oper. Res. Ser. 1. 6(4):1999;3-19. (in Russian).
5. Alekseev V.E., Korobitsyn D.V. Complexity of some problems on hereditary classes of graphs. Discrete Math. 4(4):1992;34-40. (in Russian).
6. 5,diamond)-free graphs Discrete Math. 250:2002;1-22.
7. Balas E., Yu Ch.S. On graphs with polynomially solvable maximum-weight clique problem. Networks. 19:1989;247-253.
8. Brandstädt A., Lozin V.V. A note on. α -redundant vertices in graphs Discrete Appl. Math. 108:2001;301-308.
9. 5 -free graphs Discrete Appl. Math. 125:2003;215-224.
10. D.V. Korobitsyn, On the complexity of determining the domination number in monogenic classes of graphs, Diskret. Mat. 2(3) (1990) 90-96 (in Russian, translation in Discrete Math. Appl. 2(2) (1992) 191-199).
11. D.V. Korobitsyn, On the complexity of determining the domination number in monogenic classes of graphs, Diskret. Mat. 2(3) (1990) 90-96 (in Russian, translation in Discrete Math. Appl. 2(2) (1992) 191-199).
12. Minty G.J. On maximal independent sets in claw-free graphs. J. Combin Theory Ser. B. 28(3):1980;284-304.
13. 5 -free graphs Inform. Process. Lett. 61:1997;137-143.
14. Poljak S. A note on stable sets and coloring of graphs. Comment. Math. Univ. Carolin. 15:1974;307-309.
15. Sbihi N. Algorithme de recherche d'un stable set de cardinalite maximum dans un graphe sans etoile. Discrete Math. 29:1980;505-517.
16. Tarjan R.E. Decomposition by clique separators. Discrete Math. 55:1985;221-232.
17. Tsukiyama S., Ide M., Ariochi H., Shirakawa I. A new algorithm for generating all the maximal independent sets. SIAM J. Comput. 6(3):1977;505-517.