{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:48:14Z","timestamp":1725515294072},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540727910"},{"type":"electronic","value":"9783540727927"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72792-7_14","type":"book-chapter","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T12:07:11Z","timestamp":1182773231000},"page":"167-181","source":"Crossref","is-referenced-by-count":1,"title":["Matching Problems in Polymatroids Without Double Circuits"],"prefix":"10.1007","author":[{"given":"M\u00e1rton","family":"Makai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gyula","family":"Pap","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e1cint","family":"Szab\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02579199","volume":"7","author":"A. Dress","year":"1987","unstructured":"Dress, A., Lov\u00e1sz, L.: On some combinatorial properties of algebraic matroids. Combinatorica\u00a07(1), 39\u201348 (1987)","journal-title":"Combinatorica"},{"key":"14_CR2","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Canadian Journal of Mathematics\u00a017, 449\u2013467 (1965)","journal-title":"Canadian Journal of Mathematics"},{"key":"14_CR3","unstructured":"Fekete, Z.: Source location with rigidity and tree packing requirements. TR-2005-04, http:\/\/www.cs.elte.hu\/egres"},{"issue":"1-3","key":"14_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0166-218X(01)00213-X","volume":"115","author":"A. Frank","year":"2001","unstructured":"Frank, A., Jord\u00e1n, T., Szigeti, Z.: An orientation theorem with parity conditions. Discrete Appl. Math.\u00a0115(1-3), 37\u201347 (2001)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"14_CR5","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/S0166-218X(02)00462-6","volume":"131","author":"A. Frank","year":"2003","unstructured":"Frank, A., Kir\u00e1ly, T., Kir\u00e1ly, Z.: On the orientation of graphs and hypergraphs. Discrete Appl. Math.\u00a0131(2), 385\u2013400 (2003)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"14_CR6","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1137\/0211014","volume":"11","author":"P.M. Jensen","year":"1982","unstructured":"Jensen, P.M., Korte, B.: Complexity of matroid property algorithms. SIAM Journal on Computing\u00a011(1), 184\u2013190 (1982)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR7","unstructured":"Kir\u00e1ly, T., Szab\u00f3, J.: A note on parity constrained orientations. TR-2003-11, http:\/\/www.cs.elte.hu\/egres"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01534980","volume":"4","author":"G. Laman","year":"1970","unstructured":"Laman, G.: On graphs and rigidity of plane skeletal structures. J. Engrg. Math.\u00a04, 331\u2013340 (1970)","journal-title":"J. Engrg. Math."},{"key":"14_CR9","unstructured":"Lov\u00e1sz, L.: The matroid matching problem. In: Algebraic methods in graph theory, vol. I, II, Szeged, Colloq. Math. Soc. J\u00e1nos Bolyai vol. 25, pp. 495\u2013517 (1978)"},{"issue":"2","key":"14_CR10","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/0095-8956(80)90066-0","volume":"28","author":"L. Lov\u00e1sz","year":"1980","unstructured":"Lov\u00e1sz, L.: Matroid matching and some applications. J. Combin. Theory Ser. B\u00a028(2), 208\u2013236 (1980)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"14_CR11","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1137\/0603009","volume":"3","author":"L. Lov\u00e1sz","year":"1982","unstructured":"Lov\u00e1sz, L., Yemini, Y.: On generic rigidity in the plane. SIAM J. Algebraic Discrete Methods\u00a03(1), 91\u201398 (1982)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"1-2","key":"14_CR12","first-page":"121","volume":"42","author":"L. Lov\u00e1sz","year":"1980","unstructured":"Lov\u00e1sz, L.: Selecting independent lines from a family of lines in a space. Acta Sci. Math. (Szeged)\u00a042(1-2), 121\u2013131 (1980)","journal-title":"Acta Sci. Math."},{"issue":"106","key":"14_CR13","doi-asserted-by":"crossref","first-page":"604","DOI":"10.21136\/CMJ.1981.101776","volume":"31","author":"L. Nebesk\u00fd","year":"1981","unstructured":"Nebesk\u00fd, L.: A new characterization of the maximum genus of a graph. Czechoslovak Math. J.\u00a031(106), 604\u2013613 (1981)","journal-title":"Czechoslovak Math. J."},{"key":"14_CR14","volume-title":"Combinatorial optimization. Polyhedra and efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial optimization. Polyhedra and efficiency. 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-72792-7_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,15]],"date-time":"2021-08-15T16:52:01Z","timestamp":1629046321000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72792-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540727910","9783540727927"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72792-7_14","relation":{},"subject":[]}}