{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:52:57Z","timestamp":1752231177077},"reference-count":16,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":9628,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1980,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>An efficient algorithm is presented for finding, in order, <jats:italic>K<\/jats:italic> best spanning arborescences in a given network with <jats:italic>n<\/jats:italic> vertices and <jats:italic>m<\/jats:italic> edges. The time is <jats:italic>O(Km<\/jats:italic> log <jats:italic>n<\/jats:italic>), and space is <jats:italic>O(K + m<\/jats:italic>).<\/jats:p>","DOI":"10.1002\/net.3230100202","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T11:17:50Z","timestamp":1178882270000},"page":"91-109","source":"Crossref","is-referenced-by-count":29,"title":["The <i>k<\/i> best spanning arborescences of a network"],"prefix":"10.1002","volume":"10","author":[{"given":"P. M.","family":"Camerini","sequence":"first","affiliation":[]},{"given":"L.","family":"Fratta","sequence":"additional","affiliation":[]},{"given":"F.","family":"Maffioli","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"The Design and Analysis of Computer Algorithms","author":"Aho A. V.","year":"1974"},{"key":"e_1_2_1_3_2","unstructured":"P. M.Camerini L.Fratta andF.Maffioli \u201cTheKShortest Spanning Trees of a Graph \u201d Int. Rep. 73\u201310 IEE\u2010LCE Politecnico di Milano 1973."},{"key":"e_1_2_1_4_2","first-page":"419","volume-title":"Proceedings of the 3rd International Symposium on Network Theory","author":"Camerini P. M.","year":"1975"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230090403"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1137\/0205051"},{"key":"e_1_2_1_7_2","series-title":"Tech. Rep. CU\u2010CS\u2010103\u201377","volume-title":"Finding All Spanning Trees in Directed and Undirected Graphs","author":"Gabow H. N.","year":"1977"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1137\/0206011"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1137\/0202024"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230010305"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_2_1_12_2","volume-title":"The Art of Computer Programming, Vol. 3: Sorting and Searching","author":"Knuth D.","year":"1973"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.18.7.401"},{"key":"e_1_2_1_14_2","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler E. L.","year":"1976"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.16.3.682"},{"key":"e_1_2_1_16_2","doi-asserted-by":"crossref","unstructured":"R. E.Tarjan \u201cEfficiency of a Good but not Linear Set Union Algorithm \u201dJ. ACM 215\u2013225(1975).","DOI":"10.1145\/321879.321884"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230070103"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230100202","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230100202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T11:19:07Z","timestamp":1699787947000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230100202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,6]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1980,6]]}},"alternative-id":["10.1002\/net.3230100202"],"URL":"https:\/\/doi.org\/10.1002\/net.3230100202","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980,6]]}}}