{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:10:25Z","timestamp":1775052625631,"version":"3.50.1"},"reference-count":2,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,11,6]],"date-time":"2006-11-06T00:00:00Z","timestamp":1162771200000},"content-version":"vor","delay-in-days":13093,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1971,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Edmonds [1] has given an algorithm for constructing a maximum\u2010weight branching in a weighted directed graph. His proof that the algorithm is correct is based on linear programming theory, and establishes as a by\u2010product that a certain polyhedron has integer vertices. Here we give a direct combinatorial proof of the correctness of the algorithm.<\/jats:p>","DOI":"10.1002\/net.3230010305","type":"journal-article","created":{"date-parts":[[2007,5,10]],"date-time":"2007-05-10T23:18:04Z","timestamp":1178839084000},"page":"265-272","source":"Crossref","is-referenced-by-count":66,"title":["A simple derivation of edmonds' algorithm for optimum branchings"],"prefix":"10.1002","volume":"1","author":[{"given":"R. M.","family":"Karp","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,11,6]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.6028\/jres.071B.032"},{"key":"e_1_2_1_2_3","first-page":"335","volume":"11","year":"1968","journal-title":"Amer. Math. Soc. Lectures in Appl. Math."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230010305","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230010305","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T03:27:47Z","timestamp":1699759667000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230010305"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1971,1]]},"references-count":2,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1971,1]]}},"alternative-id":["10.1002\/net.3230010305"],"URL":"https:\/\/doi.org\/10.1002\/net.3230010305","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1971,1]]}}}