{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:35:45Z","timestamp":1774370145408,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1981,12,1]],"date-time":"1981-12-01T00:00:00Z","timestamp":376012800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1981,12]]},"DOI":"10.1007\/bf01589347","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T12:22:39Z","timestamp":1114690959000},"page":"225-232","source":"Crossref","is-referenced-by-count":27,"title":["A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles"],"prefix":"10.1007","volume":"20","author":[{"given":"Wen-lian","family":"Hsu","sequence":"first","affiliation":[]},{"given":"Yoshiro","family":"Ikura","sequence":"additional","affiliation":[]},{"given":"George L.","family":"Nemhauser","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"The design and analysis of computer algorithms","author":"A.V. Aho","year":"1974","unstructured":"A.V. Aho, J.E. Hopcroft and J.D. Ullman,The design and analysis of computer algorithms (Addison-Wesley, Reading, MA, 1974)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1962","unstructured":"J. Edmonds, \u201cPaths, trees and flowers\u201d,Canadian Journal of Mathematics 17 (1962) 449\u2013467.","journal-title":"Canadian Journal of Mathematics"},{"key":"CR3","volume-title":"Flows in networks","author":"L.R. Ford","year":"1962","unstructured":"L.R. Ford and D.R. Fulkerson,Flows in networks (Princeton University Press, Princeton, NJ, 1962)."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0095-8956(72)90032-9","volume":"12","author":"D.R. Fulkerson","year":"1972","unstructured":"D.R. Fulkerson, \u201cAnti-blocking polyhedra\u201d,Journal of Combinatorial Theory 12 (1972) 50\u201371.","journal-title":"Journal of Combinatorial Theory"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"M.R. Garey, D.S. Johnson and L. Stockmeyer, \u201cSome simplified NP-complete graph problems\u201d,Theoretical Computer Science 1 (1976) 237\u2013267.","journal-title":"Theoretical Computer Science"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0201013","volume":"1","author":"F. Gavril","year":"1972","unstructured":"F. Gavril, \u201cAlgorithms for minimum coloring, maximum clique, minimum covering by cliques and maximum independent set of a chordal graph\u201d,SIAM Journal on Computing 1 (1972) 180\u2013187.","journal-title":"SIAM Journal on Computing"},{"key":"CR7","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph theory","author":"F. Harary","year":"1969","unstructured":"F. Harary,Graph theory (Addison-Wesley, Reading, MA, 1969)."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"J.E. Hopcroft and R.M. Karp, \u201cAnn 5\/2algorithm for maximum matchings in bipartite graphs\u201d,SIAM Journal on Computing 2 (1973) 225\u2013231.","journal-title":"SIAM Journal on Computing"},{"key":"CR9","unstructured":"W.-L. Hsu, \u201cEfficient algorithms for some packing and covering problems on graphs\u201d, Ph.D. Thesis, Cornell University (1980)."},{"key":"CR10","first-page":"434","volume":"15","author":"A.V. Karzanov","year":"1974","unstructured":"A.V. Karzanov, \u201cDetermining the maximal flow in a network by the method of preflow\u201d,Soviet Mathematics Doklady 15 (1974) 434\u2013437.","journal-title":"Soviet Mathematics Doklady"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","volume":"28","author":"G.J. Minty","year":"1980","unstructured":"G.J. Minty, \u201cOn maximal independent sets of vertices in claw-free graphs\u201d,Journal of Combinatorial Theory (B) 28 (1980) 284\u2013304.","journal-title":"Journal of Combinatorial Theory (B)"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/BF01580222","volume":"6","author":"G.L. Nemhauser","year":"1974","unstructured":"G.L. Nemhauser and L.E. Trotter Jr., \u201cProperties of vertex packing and independence system polyhedra\u201d,Mathematical Programming 6 (1974) 48\u201361.","journal-title":"Mathematical Programming"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01593791","volume":"12","author":"L.E. Trotter Jr.","year":"1977","unstructured":"L.E. Trotter Jr., \u201cLine perfect graphs\u201d,Mathematical Programming 12 (1977) 255\u2013259.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01589347.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01589347\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01589347","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:36:35Z","timestamp":1556897795000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01589347"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,12]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981,12]]}},"alternative-id":["BF01589347"],"URL":"https:\/\/doi.org\/10.1007\/bf01589347","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,12]]}}}