{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:46Z","timestamp":1725663286063},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540102915"},{"type":"electronic","value":"9783540384359"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10291-4_30","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:10:02Z","timestamp":1330189802000},"page":"388-403","source":"Crossref","is-referenced-by-count":0,"title":["F-factors, perfect matchings and related concepts"],"prefix":"10.1007","author":[{"given":"Ulrich","family":"Derigs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"unstructured":"Balinski,M.: Integer Programming: Methods, Uses, Computation, in: G.B.Dantzig and A.F.Veinott (eds.): Mathematics of the Decision Sciences. Part I. 179\u2013256. Providence: American Mathematical Society (1968).","key":"30_CR1"},{"key":"30_CR2","doi-asserted-by":"crossref","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. Natl. Acad. Sci. U. S., 43, (1957), 842\u2013844.","journal-title":"Proc. Natl. Acad. Sci. U. S."},{"key":"30_CR3","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/BF01593800","volume":"12","author":"R. E. Burkard","year":"1977","unstructured":"Burkard, R.E., W. Hahn and U. Zimmermann: An Algebraic Approach to Assignment Problems. Math. Progr. 12, (1977), 318\u2013327.","journal-title":"Math. Progr."},{"key":"30_CR4","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Path, Trees, and Flowers. Can. J. Math. 17, (1965a), 449\u2013467.","journal-title":"Can. J. Math."},{"doi-asserted-by":"crossref","unstructured":"Edmonds,J.: Maximum Matching and a Polyhedorn with 0,1 Vertices. J. Res. NBS, (1965b), 125\u2013130.","key":"30_CR5","DOI":"10.6028\/jres.069B.013"},{"key":"30_CR6","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. Hopcroft","year":"1973","unstructured":"Hopcroft, J. und R.M. Karp: An N5\/2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM Journal on Computing 2, (1973), 225\u2013231","journal-title":"SIAM Journal on Computing"},{"key":"30_CR7","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0020-0190(79)90026-7","volume":"8","author":"J. M\u00fchlbacher","year":"1979","unstructured":"M\u00fchlbacher, J.: F-Factors of Graphs: A Generalized Matching Problem, Information Processing Letters, 8, (1979), 207\u2013214.","journal-title":"Information Processing Letters"},{"key":"30_CR8","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/BF01580222","volume":"6","author":"G. L. Nemhauser","year":"1974","unstructured":"Nemhauser, G.L. and L.E. Trotter, Jr.: Properties of Vertex Packing and Independence System Polyhedra. Math. Progr. 6, (1974), 48\u201361.","journal-title":"Math. Progr."}],"container-title":["Lecture Notes in Computer Science","Graphtheoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10291-4_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:02:57Z","timestamp":1605643377000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10291-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540102915","9783540384359"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-10291-4_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}