{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T01:13:41Z","timestamp":1779930821485,"version":"3.53.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1992,7,1]],"date-time":"1992-07-01T00:00:00Z","timestamp":709948800000},"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":[[1992,7]]},"DOI":"10.1016\/0020-0190(92)90230-s","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:38:59Z","timestamp":1027640339000},"page":"321-323","source":"Crossref","is-referenced-by-count":40,"title":["On independent spanning trees"],"prefix":"10.1016","volume":"42","author":[{"given":"Samir","family":"Khuller","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90230-S_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\/0020-0190(92)90230-S_BIB2","series-title":"Combinatorial Algorithms","first-page":"91","article-title":"Edge-disjoint branchings","volume":"9","author":"Edmonds","year":"1973"},{"issue":"1","key":"10.1016\/0020-0190(92)90230-S_BIB3","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/122413.122416","article-title":"Reducing edge connectivity to vertex connectivity","volume":"22","author":"Galil","year":"1991","journal-title":"SIGACT News"},{"key":"10.1016\/0020-0190(92)90230-S_BIB4","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0890-5401(88)90016-8","article-title":"The multi-tree approach to reliability in distributed networks","volume":"79","author":"Itai","year":"1988","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(92)90230-S_BIB5","series-title":"Packing and Covering in Combinatorics","article-title":"Fractional packing and covering","author":"Schrijver","year":"1979"},{"key":"10.1016\/0020-0190(92)90230-S_BIB6","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1002\/jgt.3190130205","article-title":"Three tree-paths","volume":"13","author":"Zehavi","year":"1989","journal-title":"J. Graph Theory"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290230S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290230S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:27:53Z","timestamp":1555129673000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290230S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":6,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1992,7]]}},"alternative-id":["002001909290230S"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90230-s","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,7]]}}}