乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T18:52:02Z","timestamp":1672512722499},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3643,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0166-218x(03)00221-x","type":"journal-article","created":{"date-parts":[[2003,7,16]],"date-time":"2003-07-16T14:54:32Z","timestamp":1058367272000},"page":"567-575","source":"Crossref","is-referenced-by-count":10,"title":["An augmenting graph approach to the stable set problem in P5-free graphs"],"prefix":"10.1016","volume":"131","author":[{"given":"Rodica","family":"Boliac","sequence":"first","affiliation":[]},{"given":"Vadim V.","family":"Lozin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0166-218X(03)00221-X_BIB1","first-page":"3","article-title":"A polynomial algorithm for the independent set problem in fork-free graphs","volume":"6","author":"Alekseev","year":"1999","journal-title":"Discrete Anal. Oper. Res."},{"key":"10.1016\/S0166-218X(03)00221-X_BIB2","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0166-218X(99)00012-8","article-title":"On minimal imperfect graphs without induced P5","volume":"94","author":"Barr\u00e9","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(03)00221-X_BIB3","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0166-218X(99)00072-4","article-title":"On the stability number of claw-free P5-free and more general graphs","volume":"95","author":"Brandst\u00e4dt","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(03)00221-X_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\/S0166-218X(03)00221-X_BIB5","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","article-title":"A linear recognition algorithm for cographs","volume":"14","author":"Corneil","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(03)00221-X_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\/S0166-218X(03)00221-X_BIB7","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\/S0166-218X(03)00221-X_BIB8","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0166-218X(01)00321-3","article-title":"On the stable set problem in special P5-free graphs","volume":"125","author":"Gerber","year":"2003","journal-title":"Discrete Appl. Math."},{"issue":"2\u20133","key":"10.1016\/S0166-218X(03)00221-X_BIB9","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0166-218X(97)00093-0","article-title":"Weighted parameters in (P5, P5)-free graphs","volume":"80","author":"Giakoumakis","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(03)00221-X_BIB10","first-page":"325","article-title":"Polynomial algorithms for perfect graphs","volume":"21","author":"Gr\u00f6tschel","year":"1984","journal-title":"Ann. Discrete Math."},{"issue":"2","key":"10.1016\/S0166-218X(03)00221-X_BIB11","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/S0377-2217(99)00460-9","article-title":"Stability in P5- and Banner-free graphs","volume":"125","author":"Lozin","year":"2000","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0166-218X(03)00221-X_BIB12","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\/S0166-218X(03)00221-X_BIB13","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0020-0190(96)00197-4","article-title":"Polynomial algorithms for the maximum independent set problem on particular classes of P5-free graphs","volume":"61","author":"Mosca","year":"1997","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(03)00221-X_BIB14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0166-218X(99)00046-3","article-title":"Independent sets in certain P6-free graphs","volume":"92","author":"Mosca","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(03)00221-X_BIB15","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0095-8956(89)90019-1","article-title":"The strong perfect graph conjecture for pan-free graphs","volume":"47","author":"Olariu","year":"1989","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(03)00221-X_BIB16","first-page":"307","article-title":"A note on stable sets and coloring of graphs","volume":"15","author":"Poljak","year":"1974","journal-title":"Comment. Math. Univ. Carolinae"},{"key":"10.1016\/S0166-218X(03)00221-X_BIB17","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":"Sbihi","year":"1980","journal-title":"Discrete Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0300221X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0300221X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T13:51:28Z","timestamp":1552830688000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X0300221X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0166218X0300221X"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(03)00221-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}