{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:46:33Z","timestamp":1778496393822,"version":"3.51.4"},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"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":[[1978,1]]},"DOI":"10.1016\/0020-0190(78)90030-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"10-14","source":"Crossref","is-referenced-by-count":100,"title":["The min-max spanning tree problem and some extensions"],"prefix":"10.1016","volume":"7","author":[{"given":"P.M.","family":"Camerini","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(78)90030-3_BIB1","series-title":"The design and analysis of Computer algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(78)90030-3_BIB2","first-page":"419","article-title":"Efficient methods for ranking trees","author":"Camerini","year":"1975","journal-title":"Proc. of 3rd Int. Symp. on Network Theory"},{"key":"10.1016\/0020-0190(78)90030-3_BIB3","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1137\/0205051","article-title":"Finding minimum spanning trees","volume":"5","author":"Cheriton","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(78)90030-3_BIB4","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1137\/0206011","article-title":"Two algorithms for generating weighted spanning trees in order","volume":"6","author":"Gabow","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(78)90030-3_BIB5","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0020-0190(78)90030-3_BIB6","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1145\/800193.569966","article-title":"Computing minimum spanning trees efficiently","author":"Kershenbaum","year":"1972","journal-title":"Proc. of the 1972 ACM Conference"},{"key":"10.1016\/0020-0190(78)90030-3_BIB7","series-title":"Combinatorial optimization: networks and matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0020-0190(78)90030-3_BIB8","first-page":"1389","article-title":"Shortest connection networks and some generalizations","volume":"26","author":"Prim","year":"1957","journal-title":"B.S.T.J."},{"key":"10.1016\/0020-0190(78)90030-3_BIB9","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/S0022-0000(76)80029-3","article-title":"Finding the median","volume":"13","author":"Sch\u00f6nhage","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(78)90030-3_BIB10","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1002\/net.3230070103","article-title":"Finding optimum branchings","volume":"7","author":"Tarjan","year":"1977","journal-title":"Networks"},{"key":"10.1016\/0020-0190(78)90030-3_BIB11","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(78)90030-3_BIB12","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0020-0190(75)90056-3","article-title":"An O(\u2223E\u2223 log log \u2223V\u2223) algorithm for finding minimum spanning trees","volume":"4","author":"Yao","year":"1975","journal-title":"Information Processing Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019078900303?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019078900303?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:27:01Z","timestamp":1555086421000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019078900303"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,1]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1978,1]]}},"alternative-id":["0020019078900303"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(78)90030-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1978,1]]}}}