{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T14:56:41Z","timestamp":1777474601431,"version":"3.51.4"},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1979,1,1]],"date-time":"1979-01-01T00:00:00Z","timestamp":283996800000},"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":[[1979,1]]},"DOI":"10.1016\/0020-0190(79)90086-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"24-27","source":"Crossref","is-referenced-by-count":45,"title":["Edge-disjoint branching in directed multigraphs"],"prefix":"10.1016","volume":"8","author":[{"given":"Yossi","family":"Shiloach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(79)90086-3_BIB1","series-title":"Combinatorial Algorithms","first-page":"91","article-title":"Edge-disjoint branchings, combinatorial algorithms","author":"Edmonds","year":"1972"},{"key":"10.1016\/0020-0190(79)90086-3_BIB2","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1137\/0204043","article-title":"Network flows and testing graph connectivity","volume":"4","author":"Even","year":"1975","journal-title":"SIAM J. Computing"},{"key":"10.1016\/0020-0190(79)90086-3_BIB3","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/0020-0190(79)90086-3_BIB4","doi-asserted-by":"crossref","DOI":"10.1109\/SWAT.1973.6","article-title":"Efficient algorithms for determining an extremal tree of a graph","author":"Kameda","year":"1973","journal-title":"Proc. 14th Annual IEEE Symp. on Switching and Automata Theory"},{"key":"10.1016\/0020-0190(79)90086-3_BIB5","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1109\/TCT.1969.1082966","article-title":"Maximally distant trees and principal partition of a linear graph","volume":"16","author":"Kishi","year":"1969","journal-title":"IEEE Trans. on Circuit Theory"},{"issue":"Ser. B","key":"10.1016\/0020-0190(79)90086-3_BIB6","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. Combinatorial Theory"},{"key":"10.1016\/0020-0190(79)90086-3_BIB7","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","article-title":"Edge-disjoint spanning trees of finite graphs","volume":"36","author":"Nash-Williams","year":"1961","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0020-0190(79)90086-3_BIB8","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":"Information Processing Lett."},{"key":"10.1016\/0020-0190(79)90086-3_BIB9","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF00268499","article-title":"Edge-disjoint spanning trees and depth first search","volume":"6","author":"Tarjan","year":"1976","journal-title":"Acta Informatica"},{"key":"10.1016\/0020-0190(79)90086-3_BIB10","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","article-title":"On the problem of decomposing a graph into n connected factors","volume":"3","author":"Tutte","year":"1961","journal-title":"J. London Math. Soc."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079900863?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079900863?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:28:14Z","timestamp":1555086494000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019079900863"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,1]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979,1]]}},"alternative-id":["0020019079900863"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(79)90086-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1979,1]]}}}