On the use of Boolean methods for the computation of the stability number

Discrete Applied Mathematics

Volumn 76, Issue 1-3, 1997, Pages 183-203

  Hertz, Alain ^a  

^a EPFL   (Switzerland)

Author keywords

Boolean methods; Stability number

Indexed keywords

EID: 0041625944     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00124-2     Document Type: Article

References (25)

1. E. Balas, V. Chvátal and J. Nesetril, On the maximum weight clique problem, Math. Oper. Res. 12 (1987) 522-535.
2. C. Berge, Graphs and Hypergraphs (North-Holland, Amsterdam, 1973).
3. 2, Discrete Math. 115 (1993) 51-55.
4. V. Chvátal and P.L. Hammer, Aggregation of inequalities in integer programming, Ann. of Discrete Math. 1 (1973) 145-162.
5. C. De Simone, On the vertex packing problem, Graphs Combin. 9 (1993) 19-30.
6. C. De Simone and A. Sassano, Stability number of bull- and chair-free graphs, Discrete Appl. Math. 41 (1993) 121-129.
7. Ch. Ebenegger, P.L. Hammer and D. de Werra, Pseudo-Boolean Functions and Stability of Graphs, Ann. Discrete Math. 19 (1984) 83-98.
8. S. Foldes and P.L. Hammer, Split graphs, in: Proceedings of 8th South-Easterm Conference on Combinatorics, Graph Theory and Computing (1977) 311-315.
9. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness (Freeman, San Francisco, 1978).
10. M.C. Golumbic, Threshold graphs and synchronizing parallel processes, in: A. Hajnal and V.T. Sós, eds., Combinatorics, Coll, Math. Soc. J. Bolyai 18 (1978) 419-428.
11. M.C. Golumbic and P.L. Hammer, Stability in circular arc graphs, RUTCOR Research Report 12-86, Rutgers University, New Brunswick, USA, 1986.
12. M. Groetschel, L. Lovász and A. Schrijver, Polynomial algorithms for perfect graphs, Ann. Discrete Math. 21 (1984) 325-356.
13. P.L. Hammer and A. Hertz, On a transformation which preserves the stability number, ORWP 91/12, Ecole Polytechnique Fédérale de Lausanne, Switzerland 1991.
14. P.L. Hammer, N.V.R. Mahadev and D. de Werra, Stability in CAN-free graphs, J. Combin. Theory B 38 (1985) 23-30.
15. P.L. Hammer, N.V.R. Mahadev and D. de Werra, The struction of a graph: application to CN-free graphs, Combinatorica 5 (1985) 141-147.
16. P.L. Hammer and S. Rudeanu, Boolean Methods in Operations Research (Springier, New York, 1968).
17. P.L. Hammer and B. Simeone, The splittance of a graph, Combinatorica 1 (1981) 375-384.
18. A. Hertz, Quelques utilisations de la struction, Discrete Math. 59 (1986) 79-89.
19. A. Hertz, Polynomially solvable cases for the maximum stable set problem, Discrete Appl. Math. 60 (1995) 195-210..
20. A. Hertz and D. de Werra, On the stability number of AH-free graphs, J. Graph Theory 17 (1993) 53-63.
21. W.L. Hsu, Y. Ikura and G.L. Nemhauser, A polynomial algorithm for maximum weighted vertex packings in graphs without long odd cycles, Math. Programming 20 (1981) 225-232.
22. L. Lovász and M.D. Plummer, Matching theory, Ann. Discrete Math. 29 (1986) 471-480.
23. F. Maffray and M. Preissmann, linear recognition of pseudo-split graphs, Research Report LSD2-ARTEMIS, Université J. Fourier, Grenoble, France, 1993.
24. G.J. Minty, On maximal independent sets of vertices in claw-free graphs, J. Combin. Theory B 28 (1980) 284-304.
25. N. Sbihi, Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoile, Discrete Math. 29 (1980) 53-76.