{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T03:27:48Z","timestamp":1787714868531,"version":"build-2784847793"},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,6,1]],"date-time":"1994-06-01T00:00:00Z","timestamp":770428800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6986,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1994,6]]},"DOI":"10.1016\/s0022-0000(05)80064-9","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T11:18:35Z","timestamp":1124536715000},"page":"533-551","source":"Crossref","is-referenced-by-count":202,"title":["Trans-dichotomous algorithms for minimum spanning trees and shortest paths"],"prefix":"10.1016","volume":"48","author":[{"given":"Michael L.","family":"Fredman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dan E.","family":"Willard","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(05)80064-9_bib1","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1145\/77600.77615","article-title":"Faster algorithms for the shortest path problem","volume":"37","author":"Ahuja","year":"1990","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(05)80064-9_bib2","first-page":"217","article-title":"Hash functions for priority queues","volume":"63","author":"Ajtai","year":"1984","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0022-0000(05)80064-9_bib3","series-title":"Proceedings, 15th Annual ACM Symposium on Theory of Computing","first-page":"80","article-title":"Lower bounds for algebraic computation trees","author":"Ben-Or","year":"1983"},{"key":"10.1016\/S0022-0000(05)80064-9_bib4","unstructured":"B. Dixon, M. Rauch, and R. E. Tarjan, Verification and sensitivity analysis of minimum spanning trees in linear time, unpublished manuscript."},{"key":"10.1016\/S0022-0000(05)80064-9_bib5","doi-asserted-by":"crossref","first-page":"1343","DOI":"10.1145\/50087.50096","article-title":"An alternative to Fibonacci heaps with applications to parallel computation","volume":"31","author":"Driscoll","year":"1988","journal-title":"Comm. ACM"},{"key":"10.1016\/S0022-0000(05)80064-9_bib6","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","article-title":"Fibonacci heaps and their uses in improved network optimization algorithms","volume":"34","author":"Fredman","year":"1987","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(05)80064-9_bib7","doi-asserted-by":"crossref","DOI":"10.1016\/0022-0000(93)90040-4","article-title":"Surpassing the information theoretic bound with fusion trees","volume":"47","author":"Fredman","year":"1993","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80064-9_bib8","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02579168","article-title":"Efficient algorithms for finding minimum spanning trees in undirected and directed graphs","volume":"6","author":"Gabow","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/S0022-0000(05)80064-9_bib9","series-title":"Proceedings, 25th Annual IEEE Symposium on Foundations of Computer Science","first-page":"201","article-title":"Linear verification for spanning trees","author":"Komlos","year":"1984"},{"key":"10.1016\/S0022-0000(05)80064-9_bib10","article-title":"A Balanced Tree Scheme for Meldable Heaps with Updates","author":"Peterson","year":"1987"},{"key":"10.1016\/S0022-0000(05)80064-9_bib11","series-title":"Data Structures and Network Algorithms","author":"Tarjan","year":"1983"},{"key":"10.1016\/S0022-0000(05)80064-9_bib12","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF01683268","article-title":"Design and implementation of an efficient priority queue","volume":"10","author":"Van Emde Boas","year":"1977","journal-title":"Math. Systems Theory"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800649?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800649?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T22:27:33Z","timestamp":1548196053000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800649"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,6]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,6]]}},"alternative-id":["S0022000005800649"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80064-9","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,6]]}}}