{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:09:49Z","timestamp":1709813389913},"reference-count":11,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11885,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1981]]},"DOI":"10.1016\/0012-365x(81)90218-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:31:50Z","timestamp":1027639910000},"page":"181-191","source":"Crossref","is-referenced-by-count":18,"title":["Algorithms for minimum covering by cliques and maximum clique in claw-free perfect graphs"],"prefix":"10.1016","volume":"37","author":[{"given":"Wen-Lian","family":"Hsu","sequence":"first","affiliation":[]},{"given":"George L.","family":"Nemhauser","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(81)90218-1_BIB1","series-title":"Proc. 16th Annu. Symp. on Foundations of Computer Science","first-page":"100","article-title":"An O(n2.5) algorithm for maximum matching in general graphs","author":"Even","year":"1975"},{"key":"10.1016\/0012-365X(81)90218-1_BIB2","series-title":"Report 79.136","article-title":"On stable set polyhedra for K1.3-free graphs","author":"Giles","year":"1979"},{"key":"10.1016\/0012-365X(81)90218-1_BIB3","series-title":"Report No. 80.151","article-title":"The ellipsoid method and its consequences in combinatorial optimization","author":"Gr\u00f6tschel","year":"1980"},{"key":"10.1016\/0012-365X(81)90218-1_BIB4","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n52 algorithm for maximum matchings in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(81)90218-1_BIB5","series-title":"Tech. Report No. 435","article-title":"How to color claw-free perfect graphs","author":"Hsu","year":"1979"},{"key":"10.1016\/0012-365X(81)90218-1_BIB6","series-title":"Ph.D. Dissertation","article-title":"Efficient algorithms for some packing and covering problems on graphs","author":"Hsu","year":"1980"},{"key":"10.1016\/0012-365X(81)90218-1_BIB7","series-title":"Ph.D. Dissertation","article-title":"Ramifications of matching theory","author":"Koch","year":"1979"},{"key":"10.1016\/0012-365X(81)90218-1_BIB8","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"},{"key":"10.1016\/0012-365X(81)90218-1_BIB9","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/S0095-8956(76)80005-6","article-title":"The strong perfect graph conjecture is true for K1.3-free graphs","volume":"21","author":"Parthasarathy","year":"1976","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0012-365X(81)90218-1_BIB10","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. Carolin."},{"key":"10.1016\/0012-365X(81)90218-1_BIB11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0012-365X(90)90287-R","article-title":"Algorithmes de recherche d'un stable de cardinalite maximum dans un graphe sans etoile","volume":"29","author":"Sbihi","year":"1980","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X81902181?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X81902181?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T07:24:02Z","timestamp":1555140242000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X81902181"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"references-count":11,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1981]]}},"alternative-id":["0012365X81902181"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(81)90218-1","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1981]]}}}