{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T07:12:49Z","timestamp":1780384369338,"version":"3.54.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5252,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1999,3]]},"DOI":"10.1016\/s0012-365x(98)00338-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:14:12Z","timestamp":1027602852000},"page":"245-249","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"title":["Independent branchings in acyclic diagraphs"],"prefix":"10.1016","volume":"199","author":[{"given":"Andreas","family":"Huck","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00338-0_BIB1","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/0196-6774(88)90015-6","article-title":"Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs","volume":"9","author":"Cheriyan","year":"1988","journal-title":"J. Algorithms"},{"key":"10.1016\/S0012-365X(98)00338-0_BIB2","series-title":"Combinarotial Structures and their Applications","first-page":"69","article-title":"Submodular functions, matroids and certain polyhedra","author":"Edmonds","year":"1969"},{"key":"10.1016\/S0012-365X(98)00338-0_BIB3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01202468","article-title":"Independent trees in graphs","volume":"10","author":"Huck","year":"1994","journal-title":"Graphs Combin."},{"key":"10.1016\/S0012-365X(98)00338-0_BIB4","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1002\/jgt.3190200212","article-title":"Disproof of a conjecture about independent branching in k-connected directed graphs","volume":"20","author":"Huck","year":"1995","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(98)00338-0_BIB5","series-title":"Proc. 25th Annu. IEEE Symp. on Foundations of Computer Sciences","first-page":"137","article-title":"The multi-tree approach to reliability in distributed networks","author":"Itai","year":"1984"},{"key":"10.1016\/S0012-365X(98)00338-0_BIB6","series-title":"Packing and Covering in Combinatorics","article-title":"Fractional packing and covering","author":"Schrijver","year":"1979"},{"key":"10.1016\/S0012-365X(98)00338-0_BIB7","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1002\/jgt.3190110309","article-title":"Vertex-disjoint paths and edge-disjoint branchings in directed graphs","volume":"11","author":"Whitty","year":"1987","journal-title":"J. Graph Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98003380?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98003380?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T06:03:09Z","timestamp":1757916189000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98003380"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,3]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,3]]}},"alternative-id":["S0012365X98003380"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00338-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Independent branchings in acyclic diagraphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0012-365X(98)00338-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}