{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:26Z","timestamp":1759637606077},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540688860"},{"type":"electronic","value":"9783540688914"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68891-4_6","type":"book-chapter","created":{"date-parts":[[2008,5,23]],"date-time":"2008-05-23T13:31:37Z","timestamp":1211549497000},"page":"77-96","source":"Crossref","is-referenced-by-count":9,"title":["A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs"],"prefix":"10.1007","author":[{"given":"Gianpaolo","family":"Oriolo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugo","family":"Pietropaoli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gautier","family":"Stauffer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1073\/pnas.43.9.842","volume":"43","author":"C. Berge","year":"1957","unstructured":"Berge, C.: Two theorems in graph theory. Proc. Nat. Acad. Sci. U.S.A.\u00a043, 842\u2013844 (1957)","journal-title":"Proc. Nat. Acad. Sci. U.S.A."},{"key":"6_CR2","volume-title":"Graphs and hypergraphs","author":"C. Berge","year":"1973","unstructured":"Berge, C.: Graphs and hypergraphs. Dunod, Paris (1973)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Chudnovsky, M., Seymour, P.: The structure of claw-free graphs. In: Surveys in Combinatorics 2005. London Math. Soc. Lecture Note Series, vol.\u00a0327 (2005)","DOI":"10.1017\/CBO9780511734885.008"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0012-365X(85)80001-7","volume":"55","author":"G. Cornu\u00e9jols","year":"1985","unstructured":"Cornu\u00e9jols, G., Cunningham, W.H.: Compositions for perfect graphs. Discrete Mathematics\u00a055, 245\u2013254 (1985)","journal-title":"Discrete Mathematics"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1006\/jctb.1993.1052","volume":"59","author":"J. Fouquet","year":"1993","unstructured":"Fouquet, J.: A strengthening of Ben Rebea\u2019s lemma. Journal of Combinatorial Theory\u00a059, 35\u201340 (1993)","journal-title":"Journal of Combinatorial Theory"},{"key":"6_CR6","volume-title":"Matching theory","author":"L. Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching theory. North Holland, Amsterdam (1986)"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Lozin, V.V., Milani $\\breve{c}$ , M.: A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. In: Proceedings of SODA 2006, Miami, Florida, January 22-26 (2006)","DOI":"10.1145\/1109557.1109561"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","volume":"28","author":"G.J. Minty","year":"1980","unstructured":"Minty, G.J.: On maximal independent sets of vertices in claw-free graphs. Journal of Combinatorial Theory\u00a028, 284\u2013304 (1980)","journal-title":"Journal of Combinatorial Theory"},{"issue":"2","key":"6_CR9","doi-asserted-by":"crossref","first-page":"194","DOI":"10.15807\/jorsj.44.194","volume":"44","author":"D. Nakamura","year":"2001","unstructured":"Nakamura, D., Tamura, A.: A revision of Minty\u2019s algorithm for finding a maximum weighted stable set of a claw-free graph. Journal of the Operations Research Society of Japan\u00a044(2), 194\u2013204 (2001)","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"6_CR10","unstructured":"Pulleyblank, W., Shepherd, F.: Formulations for the stable set polytope. In: Rinaldi, G., Wolsey, L.A. (eds.) Proceedings of IPCO 1993, Erice, Italy, April 19 - May 1 (1993)"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0012-365X(90)90287-R","volume":"29","author":"N. Sbihi","year":"1980","unstructured":"Sbihi, N.: Algorithme de recherche d\u2019un stable de cardinalit\u00e9 maximum dans un graphe sans \u00e9toile. Discrete Mathematics\u00a029, 53\u201376 (1980)","journal-title":"Discrete Mathematics"},{"key":"6_CR12","volume-title":"Algorithms and Combinatorics 24","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial optimization. Polyhedra and efficiency. In: Algorithms and Combinatorics 24, 3 volumes. Springer, Berlin (2003)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68891-4_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:18:03Z","timestamp":1620015483000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68891-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540688860","9783540688914"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68891-4_6","relation":{},"subject":[]}}