{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:21:18Z","timestamp":1725456078031},"publisher-location":"Berlin\/Heidelberg","reference-count":17,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354015650X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0015726","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T05:45:47Z","timestamp":1132724747000},"page":"1-14","source":"Crossref","is-referenced-by-count":2,"title":["Vertex packing algorithms"],"prefix":"10.1007","author":[{"given":"L.","family":"Lov\u00e1sz","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"E.Balas (1984): Lecture in Osnabr\u00fcck, August."},{"key":"1_CR2","first-page":"129","volume":"6","author":"L.W. Beineke","year":"1970","unstructured":"L.W. Beineke (1970): Characterizations of derived graphs, Z. Comlin. Theory 6, 129\u2013135.","journal-title":"Z. Comlin. Theory"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"C.Berge and V.Chv\u00e1tal, eds., (1984): Topics on Perlect graphs, Annals of Discrete Math. 21; North-Holland.","DOI":"10.1016\/S0304-0208(08)72921-9"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0012-365X(79)90160-2","volume":"27","author":"M. Boulala","year":"1979","unstructured":"M. Boulala and J.P. Uhry (1979): Polytope des independentes d'un graph series-parallele, Discrete Math. 27, 225\u2013243.","journal-title":"Discrete Math."},{"key":"1_CR5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"B 69","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds (1965): Maximum matching and a polyhedron with 0,1-vertices, Z. Res. Natl. Bureau of Standards B 69, 125\u2013130.","journal-title":"Z. Res. Natl. Bureau of Standards"},{"key":"1_CR6","first-page":"83","volume":"16","author":"J. Fonlupt","year":"1982","unstructured":"J. Fonlupt and J.P. Uhry (1982): Transformations which preserve perfectness and h-perfectness of graphs, Annals of Discrete Math. 16, 83\u201395.","journal-title":"Annals of Discrete Math."},{"key":"1_CR7","unstructured":"A.Frank (1976): Some polynomial algorithms for certain graphs and hypergraphs, Comlinatorics, Proc. 5th British Combin.Conf., Aberdeen 1975; Utilitas Mathematica, 211\u2013226."},{"key":"1_CR8","unstructured":"A.M.Gerards and A.Schrijver (1985): Matrices with the Edmonds-Johnson property, working paper, Inst. of Operations Research, Univ.Bonn."},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"M.Golumbic (1980): Algorithmic Graph Theory and Perfect Graphs, Academic Press.","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"1_CR10","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz and A. Schrijver (1981): The ellipsoid method and its consequences in combinatorial optimization, Comlinatorica 1, 169\u2013197.","journal-title":"Comlinatorica"},{"key":"1_CR11","unstructured":"M.Gr\u00f6tschel, L.Lov\u00e1sz and A.Schrijver (1984): Geometric methods in combinatorial optimization, Progress in Comlinatorial Optimization, Proc. Silver Jubilee Conf. Waterloo 1982; Academic Press, 167\u2013183."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"M.Gr\u00f6tschel, L.Lov\u00e1sz and A.Schrijver (1985): Relaxations of vertex packing, Z. Comlin. Theory B (submitted)","DOI":"10.1016\/0095-8956(86)90087-0"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"P.L.Hammer, N.V.R.Mahadev and D.de Werra (1985): The struction of a graph: Application to CN-free graphs, Comlinatorica 5 (to appear)","DOI":"10.1007\/BF02579377"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L. Lov\u00e1sz","year":"1979","unstructured":"L. Lov\u00e1sz (1979): On the Shannon capacity of a graph, IEEE Trans. Inform. Theory 25, 1\u20137.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1_CR15","unstructured":"L.Lov\u00e1sz and M.D.Plummer (1985): Matching Theory, Akad\u00e9miai Kiad\u00f3 \u2014 North-Holland."},{"key":"1_CR16","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","volume":"B 28","author":"G. Minty","year":"1980","unstructured":"G. Minty (1980): On maximal independent sets of vertices in claw-free graphs, Z. Coml. Theory B 28, 284\u2013304.","journal-title":"Z. Coml. Theory"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0012-365X(90)90287-R","volume":"29","author":"N. Sbihi","year":"1980","unstructured":"N. Sbihi (1980): Algorithme de recherche d'un stable de cardinalit\u00e9 maximum dans un graph sans \u00e9toile, Discrete Math. 29, 53\u201376.","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0015726","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T07:05:19Z","timestamp":1626764719000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0015726"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354015650X"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0015726","relation":{},"subject":[]}}