Polynomial algorithms for the maximum stable set problem on particular classes of P5-free graphs 1

Information Processing Letters

Volumn 61, Issue 3, 1997, Pages 137-143

  Mosca, Raffaele ^a  

^a UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

Algorithms; Combinatorial problems; Computational complexity; Stable set

Indexed keywords

EID: 0008454547     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(96)00197-4     Document Type: Article

References (16)

1. C. Arbib and R. Mosca, Polynomial algorithms for special cases of the balanced complete bipartite subgraph problem, Univ. di L'Aquila, Dipartimento di Matematica Pura e Applicata, Tech. Rept. n. 58, 1994.
2. 5, Tech. Rept. n. 79, Univ. di L'Aquila, Dipartimento di Matematica Pura e Applicata, 1995.
3. 5-free graphs, Period. Math. Hungar. 21 (4) (1990) 308-315.
4. D.G. Corneil, The complexity of generalized clique packing, Discrete Appl. Math. 12 (1985) 233-240.
5. C. De Simone and A. Galluccio, New classes of Berge perfect graphs, Tech. Rept. n. 306, Istituto di Analisi dei Sistemi ed Informatica del CNR, 1990.
6. C. De Simone and A. Sassano, Stability number of bull- and chair-free graphs, Discrete Appl. Math. 41 (1993) 121-129.
7. J.F. Desler and S.L. Hakimi, On finding a maximum stable set of a graph, in: Proc. 4th Ann. Princeton Conf. on Inf. Sci. and Sys., Princeton, NJ, 1970.
8. M.R. Garey and D.S. Johnson, The rectilinear Steiner tree problem is NP-complete, SIAM J. Appl. Math. 32 (1977) 826-834.
9. M.R. Garey, D.S. Johnson, and L. Stockmeyer, Some simplified NP-complete graph problems, Theoret. Comput. Sci. 1 (1976) 237-267.
10. M.C. Golumbic, The complexity of comparability graph recognition and coloring, Computing 18 (1977) 199-208.
11. M.C. Golumbic, Algorithmic aspects of perfect graphs, Ann. Discrete Math. 21 (1984) 301-323.
12. M. Grötschel, L. Lovász and A. Schrijver, Geometric Algorithms and Combinatorial Optimization (Springer, Berlin, 1988).
13. R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller and J.W. Thatcher, eds., Complexity of Computer Computations (Plenum Press, New York, 1972) 85-103.
14. G.J. Minty, On maximal independent sets of vertices in claw-free graphs, J. Combin. Theory Ser. B 28 (1980) 284-304.
15. S. Poljak, A note on stable sets and colorings of graphs, Comment. Math. Univ. Carolina 15 (1974) 307-309.
16. N. Shibi, Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoile, Discrete Math. 29 (1980) 53-76.