{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:46:51Z","timestamp":1759063611448},"reference-count":4,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1983,8,1]],"date-time":"1983-08-01T00:00:00Z","timestamp":428544000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1983,8]]},"DOI":"10.1016\/0020-0190(83)90073-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"73-76","source":"Crossref","is-referenced-by-count":15,"title":["A faster algorithm for finding edge-disjoint branchings"],"prefix":"10.1016","volume":"17","author":[{"given":"Po","family":"Tong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.L.","family":"Lawler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(83)90073-X_BIB1","series-title":"Combinatorial Algorithms","first-page":"91","article-title":"Edge-disjoint branchings","author":"Edmonds","year":"1972"},{"key":"10.1016\/0020-0190(83)90073-X_BIB2","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0020-0190(74)90024-6","article-title":"A good algorithm for edge-disjoint branchings","volume":"3","author":"Tarjan","year":"1975","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(83)90073-X_BIB3","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0095-8956(76)90049-6","article-title":"On two minimax theorems in graph theory","volume":"21","author":"Lov\u00e1sz","year":"1976","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0020-0190(83)90073-X_BIB4","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/0020-0190(79)90086-3","article-title":"Edge-disjoint branchings in directed multigraphs","volume":"8","author":"Shiloach","year":"1979","journal-title":"Inform. Process Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908390073X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908390073X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:56:35Z","timestamp":1555073795000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001908390073X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,8]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,8]]}},"alternative-id":["002001908390073X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(83)90073-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1983,8]]}}}