Polynomially solvable cases for the maximum stable set problem
- 23 June 1995
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 60 (1-3) , 195-210
- https://doi.org/10.1016/0166-218x(94)00051-e
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On the stability number of AH‐free graphsJournal of Graph Theory, 1993
- Stability number of bull- and chair-free graphsDiscrete Applied Mathematics, 1993
- Tabu Search—Part IINFORMS Journal on Computing, 1989
- STABULUS: A technique for finding stable sets in large graphs with tabu searchComputing, 1989
- Quelques utilisations de la structionDiscrete Mathematics, 1986
- The struction of a graph: Application toCN-free graphsCombinatorica, 1985
- Stability in CAN-free graphsJournal of Combinatorial Theory, Series B, 1985
- Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoileDiscrete Mathematics, 1980