{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T23:51:37Z","timestamp":1676677897493},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3827,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0166-218x(02)00219-6","type":"journal-article","created":{"date-parts":[[2002,10,28]],"date-time":"2002-10-28T11:05:14Z","timestamp":1035803114000},"page":"115-128","source":"Crossref","is-referenced-by-count":13,"title":["Theory of 2\u20133 Heaps"],"prefix":"10.1016","volume":"126","author":[{"given":"Tadao","family":"Takaoka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00219-6_BIB1","first-page":"1259","article-title":"An algorithm for the organization of information","volume":"3","author":"Adel'son-Vel'skii","year":"1962","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/S0166-218X(02)00219-6_BIB2","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0166-218X(02)00219-6_BIB3","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. ACM"},{"key":"10.1016\/S0166-218X(02)00219-6_BIB4","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0166-218X(02)00219-6_BIB5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"issue":"11","key":"10.1016\/S0166-218X(02)00219-6_BIB6","doi-asserted-by":"crossref","first-page":"1343","DOI":"10.1145\/50087.50096","article-title":"An alternative to Fibonacci heaps with application to parallel computation","volume":"31","author":"Driscoll","year":"1988","journal-title":"Comm. ACM"},{"key":"10.1016\/S0166-218X(02)00219-6_BIB7","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. ACM"},{"key":"10.1016\/S0166-218X(02)00219-6_BIB8","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell Sys. Tech. J."},{"key":"10.1016\/S0166-218X(02)00219-6_BIB9","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1145\/359460.359478","article-title":"A data structure for manipulating priority queues","volume":"21","author":"Vuillemin","year":"1978","journal-title":"Comm. ACM"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002196?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002196?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T09:25:42Z","timestamp":1555147542000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02002196"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0166218X02002196"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00219-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}