Conic reduction of graphs for the stable set problem

Discrete Mathematics

Volumn 222, Issue 1-3, 2000, Pages 199-211

  Lozin, V V ^a  

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

Author keywords

Graph reduction; Polynomial algorithm; Stable set

Indexed keywords

EID: 0012743544     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(99)00408-2     Document Type: Article

References (24)

1. V.E. Alekseev, On compressible graphs, Cybernet. Problems 36 (1979) 23-31 (in Russian).
2. V.E. Alekseev, On the local restrictions effect on the complexity of finding the graph independence number, Combinatorial-algebraic methods in applied mathematics, Gorkiy Univ. Press, Gorkiy, 1983, 3-13 (in Russian).
3. V.E. Alekseev, On the number of deadlock (maximal) independent sets in graphs from hereditary classes, Combinatorial-algebraic methods in discrete optimization, NNSU Publishers, Nizhniy Novgorod, 1991, pp. 5-8 (in Russian).
4. V.E. Alekseev, V.V. Lozin, On determination of the independence number by graph transformations, Proceedings of the fifth Twente Workshop "Graphs and Combinatorial Optimization", Enschede, NL, May 20-22, 1997, pp. 5-8.
5. V.E. Alekseev, V.V. Lozin, On local transformations of graphs preserving the independence number, Discrete Anal. Oper. Res. 5 (1) (1998) 3-19 (in Russian).
6. 5, diamond)-free graphs, Tech. Rept. no. 79, Univ. di L'Aquila, Dipartimento di Matematica Pure e Applicata, 1995.
7. 5-free and more general graphs, RUTCOR Research Report 27-97, Rutgers Univer., 1997.
8. L. Butz, P.L. Hammer, D. Hausmann, Reduction methods for the vertex packing problem, University of Bonn, Institute for Ekonometrie and Operations Research, Report 7540, 1975.
9. C. De Simone, A. Sassano, Stability number of bull-and chair-free graphs, Discrete Appl. Math. 41 (1993) 121-129.
10. Ch. Ebenegger, P.L. Hammer, D. de Werra, Pseudo-Boolean functions and stability of graphs, Ann. Discrete Math. 19 (1984) 83-98.
11. 5, Discrete Math. 146 (1995) 33-44.
12. M.C. Golumbic, Trivially perfect graphs, Discrete Math. 24 (1978) 105-107.
13. M.C. Golumbic, P.L. Hammer, Stability in circular-arc graphs, J. Algorithms 9 (1988) 314-320.
14. P.L. Hammer, N.V.R. Mahadev, D. de Werra, Stability in CAN-free graphs, J. Combin. Theory B 38 (1985) 23-30.
15. P.L. Hammer, N.V.R. Mahadev, D. de Werra, The struction of a graph: application to CN-free graphs, Combinatorica 5 (1985) 141-147.
16. P.L. Hammer, A. Hertz, On a transformation which preservs the stability number, RUTCOR Research Report 69-91, Rutgers Univer., 1991.
17. A. Hertz, Quelques utilisations de la struction, Discrete Math. 59 (1986) 79-89.
18. A. Hertz, D. de Werra, On the stability number of AH-free graphs, J. Graph Theory 17 (1993) 53-63.
19. A. Hertz, Polynomially solvable cases for the maximum stable set problem, Discrete Appl. Math. 60 (1995) 195-210.
20. A. Hertz, On the use of Boolean methods for the computation of the stability number, Discrete Appl. Math. 76 (1997) 183-203.
21. K.W. Hoke, M.F. Troyon, The struction algorithm for the maximum stable set problem revisited, Discrete Math. 131 (1994) 105-113.
22. L. Lovász, M.D. Plummer, Matching theory, Ann. Discrete Math. 29 (1986) 471-480.
23. 5-free graphs, Inform. Process. Lett. 61 (1997) 137-144.
24. S. Tsukigama, M. Ide, H. Ariochi, H. Ozaki, A new algorithm for generating all the maximal independent sets, SIAM J. Comput. 6 (1977) 503-517.