{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:18:09Z","timestamp":1761621489966},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,3,1]],"date-time":"2009-03-01T00:00:00Z","timestamp":1235865600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2009,3]]},"DOI":"10.1007\/s00493-009-2428-z","type":"journal-article","created":{"date-parts":[[2019,12,12]],"date-time":"2019-12-12T03:42:53Z","timestamp":1576122173000},"page":"197-214","source":"Crossref","is-referenced-by-count":25,"title":["Arc-disjoint in-trees in directed graphs"],"prefix":"10.1007","volume":"29","author":[{"given":"Naoyuki","family":"Kamiyama","sequence":"first","affiliation":[]},{"given":"Naoki","family":"Katoh","sequence":"additional","affiliation":[]},{"given":"Atsushi","family":"Takizawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,6,24]]},"reference":[{"key":"2428_CR1","first-page":"69","volume-title":"Combinatorial Structures and their Applications","author":"J. Edmonds","year":"1970","unstructured":"J. Edmonds: Submodular functions, matroids, and certain polyhedra; in Combinatorial Structures and their Applications (R. Guy, H. Hanani, N. Sauer, and J. Sch\u00f6nheim, editors), pages 69\u201387. Gordon and Breach, New York, 1970."},{"key":"2428_CR2","first-page":"91","volume-title":"Combinatorial Algorithms","author":"J. Edmonds","year":"1973","unstructured":"J. Edmonds: Edge-disjoint branchings, in Combinatorial Algorithms (R. Rustin, editor), pages 91\u201396. Academic Press, New York, 1973."},{"issue":"2","key":"2428_CR3","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1006\/jcss.1995.1022","volume":"50","author":"H. N. Gabow","year":"1995","unstructured":"H. N. Gabow: A matroid approach to finding edge connectivity and packing arborescences, Journal of Computer and System Sciences\n                           50(2) (1995), 259\u2013273.","journal-title":"Journal of Computer and System Sciences"},{"key":"2428_CR4","doi-asserted-by":"crossref","unstructured":"N. Kamiyama, N. Katoh and A. Takizawa: An efficient algorithm for the evacuation problem in a certain class of a network with uniform path-lengths, in Proceedings of the third International Conference on Algorithmic Aspects in Information and Management, volume 4508 of Lecture Notes in Computer Science, pages 178\u2013190. Springer, 2007.","DOI":"10.1007\/978-3-540-72870-2_17"},{"issue":"2","key":"2428_CR5","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0095-8956(76)90049-6","volume":"21","author":"L. Lov\u00e1sz","year":"1976","unstructured":"L. Lov\u00e1sz: On two minimax theorems in graph, J. Comb. Theory, Ser. B\n                           21(2) (1976), 96\u2013103.","journal-title":"J. Comb. Theory, Ser. B"},{"key":"2428_CR6","unstructured":"A. Schrijver: Combinatorial Optimization: Polyhedra and Efficiency; Springer, 2003."},{"issue":"2","key":"2428_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0020-0190(83)90073-X","volume":"17","author":"P. Tong","year":"1983","unstructured":"P. Tong and E. L. Lawler: A faster algorithm for finding edge-disjoint branchings, Inf. Process. Lett.\n                           17(2) (1983), 73\u201376.","journal-title":"Inf. Process. Lett."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-009-2428-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-009-2428-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-009-2428-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,12]],"date-time":"2019-12-12T03:42:58Z","timestamp":1576122178000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-009-2428-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["2428"],"URL":"https:\/\/doi.org\/10.1007\/s00493-009-2428-z","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,3]]}}}