Independent sets in extensions of 2K2-free graphs

Discrete Applied Mathematics

Volumn 146, Issue 1, 2005, Pages 74-80

  Lozin, Vadim V ^a   Mosca, Raffaele ^b  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF CHIETI   (Italy)

Author keywords

Maximal stable set; Polynomial time algorithm

Indexed keywords

ALGORITHMS; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

MAXIMAL STABLE SET; POLYNOMIAL-TIME ALGORITHMS; WEIGHT INDEPENDENT DOMINATING SET (WID); WEIGHT INDEPENDENT SET (WIS);

SET THEORY;

EID: 12444318574     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2004.07.006     Document Type: Article

References (37)

1. V.E. Alekseev, On the local restrictions effect on the complexity of finding the graph independence number, Combinatorial-Algebraic Methods in Applied Mathematics, Gorkiy University Press, Gorkiy, 1983, pp. 3-13 (in Russian).
2. V.E. Alekseev, On the number of maximal independent sets in graphs from hereditary classes, Combinatorial-Algebraic Methods in Discrete Optimization, University of Nizhny Novgorod, 1991, pp. 5-8 (in Russian).
3. V.E. Alekseev Polynomial algorithm for finding the largest independent sets in graphs without forks Discrete Appl. Math. 135 2004 3 16
4. V.E. Alekseev On easy and hard hereditary classes of graphs with respect to the independent set problem Discrete Appl. Math. 132 2004 17 26
5. C. Arbib, and R. Mosca On (P 5, diamond)-free graphs Discrete Math. 250 2002 1 22
6. R. Boliac, and V.V. Lozin Independent domination in finitely defined classes of graphs Theoret. Comput. Sci. 301 2003 271 284
7. R. Boliac, and V.V. Lozin An augmenting graph approach to the stable set problem in P 5 -free graphs Discrete Appl. Math. 131 2003 566 575
8. A. Brandstädt (P 5, diamond)-free graphs revisited structure and linear time optimization Discrete Appl. Math. 138 2004 13 27
9. A. Brandstädt, and P.L. Hammer On the stability number of claw-free P 5 -free and more general graphs Discrete Appl. Math. 95 1999 163 167
10. A. Brandstädt, and D. Kratsch On domination problems on permutation and other graphs Theoret. Comput. Sci. 54 1987 181 198
11. A. Brandstädt, D. Kratsch, On the structure of (P 5, gem)-free graphs, Discrete App. Math., accepted.
12. A. Brandstädt, H.-O. Le, and V.B. Le On alpha-redundant vertices in P 5 -free graphs Inform. Process. Lett. 82 2002 119 122
13. A. Brandstädt, and V.V. Lozin A note on α -redundant vertices in graphs Discrete Appl. Math. 108 2001 301 308
14. A. Brandstädt, and R. Mosca On variations of P 4 -sparse graphs Discrete Appl. Math. 129 2003 521 532
15. A. Brandstädt, and R. Mosca On the structure and stability number of P 5 - and Co-Chair-free graphs Discrete Appl. Math. 132 2004 47 65
16. M. Farber Independent domination in chordal graphs Oper. Res. Lett. 1 1982 134 138
17. M. Farber On diameters and radii of bridged graphs Discrete Math. 73 1989 249 260
18. M. Farber, M. Hujter, and Z. Tuza An upper bound on the number of cliques in a graph Networks 23 1993 207 210
19. J.-L. Fouquet A decomposition for a class of (P 5, P ̄ 5) -free graphs Discrete Math. 121 1993 75 83
20. J.-L. Fouquet, V. Giakoumakis, F. Maire, and H. Thuillier On graphs without P 5 and P̄ 5 Discrete Math. 146 1995 33 44
21. J.-L. Fouquet, and V. Giakoumakis On semi- P 4 -sparse graphs Discrete Math. 165-166 1997 277 300
22. M.U. Gerber, A. Hertz, V.V. Lozin, Augmenting chains in graphs without a skew star, RUTCOR Research Report RRR 30-2003, Rutgers University, 2003 (available online at http://rutcor.rutgers.edu/ ∼ rrr/2003.html).
23. M.U. Gerber, A. Hertz, and D. Schindl P 5 -free augmenting graphs and the maximum stable set problem Discrete Appl. Math. 132 2004 109 119
24. M.U. Gerber, and V.V. Lozin On the stable set problem in special P 5 -free graphs Discrete Appl. Math. 125 2003 215 224
25. V. Giakoumakis, and I. Rusu Weighted parameters in (P 5, P̄ 5) -free graphs Discrete Appl. Math. 80 1997 255 261
26. V. Giakoumakis, and J.-M. Vanherpe On extended P 4 -reducible and extended P 4 -sparse graphs Theoret. Comput. Sci. 180 1997 269 286
27. M. Grötschel, L. Lovász, and A. Schrijver Polynomial algorithms for perfect graphs Ann. Discrete Math. 21 1984 325 356
28. A. Hertz, V. Lozin, and D. Schindl On finding augmenting chains in extensions of claw-free graphs Inform. Process. Lett. 86 2003 311 316
29. V.V. Lozin Stability in P 5 and banner-free graphs European J. Oper. Res. 125 2000 292 297
30. G.J. Minty On maximal independent sets of vertices in claw-free graphs J. Combin. Theory Ser. B 28 1980 284 304
31. R. Mosca Polynomial algorithms for the maximum stable set problem on particular classes of P 5 -free graphs Inform. Process. Lett. 61 1997 137 143
32. R. Mosca Some results on maximum stable sets in certain P 5 -free graphs Discrete Appl. Math. 132 2003 175 183
33. D. Nakamura, and A. Tamura A revision of Minty's algorithm for finding a maximum weight stable set in a claw-free graph J. Oper. Res. Soc. Japan 44 2001 194 204
34. E. Prisner, Graphs with few Cliques, Graph Theory, Combinatorics, and Algorithms, vol. 1, 2 (Kalamazoo, MI, 1992), Wiley-Interscience Publishers, Wiley, New York, 1995, pp. 945-956.
35. N. Sbihi Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoile Discrete Math. 29 1980 53 76
36. S. Tsukiyama, M. Ide, H. Ariyoshi, and I. Shirakawa A new algorithm for generating all the maximal independent sets SIAM J. Comput. 6 1977 505 517
37. I. Zverovich, Independent domination in 2 P 3 -free perfect graphs, DIMACS Technical Report 2003-22, Rutgers University, 2003 (available online at http://dimacs.rutgers.edu/TechnicalReports/2003.html).