{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T19:09:06Z","timestamp":1726513746420},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1997,2]]},"DOI":"10.1016\/s0020-0190(96)00197-4","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T17:13:10Z","timestamp":1051117990000},"page":"137-143","source":"Crossref","is-referenced-by-count":37,"title":["Polynomial algorithms for the maximum stable set problem on particular classes of P5-free graphs"],"prefix":"10.1016","volume":"61","author":[{"given":"Raffaele","family":"Mosca","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(96)00197-4_BIB1","article-title":"Polynomial algorithms for special cases of the balanced complete bipartite subgraph problem","author":"Arbib","year":"1994","journal-title":"Univ. di L'Aquila, Dipartimento di Matematica Pura e Applicata, Tech. Rept. n. 58"},{"key":"10.1016\/S0020-0190(96)00197-4_BIB2","article-title":"The maximum stable set problem for particular graphs with no induced P5","author":"Arbib","year":"1995"},{"issue":"4","key":"10.1016\/S0020-0190(96)00197-4_BIB3","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/BF02352694","article-title":"Dominating cliques in P5-free graphs","volume":"21","author":"Bacs\u00f2","year":"1990","journal-title":"Period. Math. Hungar."},{"key":"10.1016\/S0020-0190(96)00197-4_BIB4","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0166-218X(85)90027-7","article-title":"The complexity of generalized clique packing","volume":"12","author":"Corneil","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(96)00197-4_BIB5","article-title":"New classes of Berge perfect graphs","author":"De Simone","year":"1990"},{"key":"10.1016\/S0020-0190(96)00197-4_BIB6","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0166-218X(93)90032-J","article-title":"Stability number of bull- and chair-free graphs","volume":"41","author":"De Simone","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(96)00197-4_BIB7","series-title":"Proc. 4th Ann. Princeton Conf. on Inf. Sci. and Sys.","article-title":"On finding a maximum stable set of a graph","author":"Desler","year":"1970"},{"key":"10.1016\/S0020-0190(96)00197-4_BIB8","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1137\/0132071","article-title":"The rectilinear Steiner tree problem is NP-complete","volume":"32","author":"Garey","year":"1977","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0020-0190(96)00197-4_BIB9","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(96)00197-4_BIB10","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF02253207","article-title":"The complexity of comparability graph recognition and coloring","volume":"18","author":"Golumbic","year":"1977","journal-title":"Computing"},{"key":"10.1016\/S0020-0190(96)00197-4_BIB11","first-page":"301","article-title":"Algorithmic aspects of perfect graphs","volume":"21","author":"Golumbic","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0020-0190(96)00197-4_BIB12","series-title":"Geometric Algorithms and Combinatorial Optimization","author":"Gr\u00f6tschel","year":"1988"},{"key":"10.1016\/S0020-0190(96)00197-4_BIB13","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0020-0190(96)00197-4_BIB14","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","article-title":"On maximal independent sets of vertices in claw-free graphs","volume":"28","author":"Minty","year":"1980","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0020-0190(96)00197-4_BIB15","first-page":"307","article-title":"A note on stable sets and colorings of graphs","volume":"15","author":"Poljak","year":"1974","journal-title":"Comment. Math. Univ. Carolina"},{"key":"10.1016\/S0020-0190(96)00197-4_BIB16","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0012-365X(90)90287-R","article-title":"Algorithme de recherche d'un stable de cardinalit\u00e9 maximum dans un graphe sans \u00e9toile","volume":"29","author":"Shibi","year":"1980","journal-title":"Discrete Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019096001974?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019096001974?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T14:53:03Z","timestamp":1555944783000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019096001974"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["S0020019096001974"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(96)00197-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}