{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T08:17:30Z","timestamp":1725783450106},"reference-count":18,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,10,8]],"date-time":"2020-10-08T00:00:00Z","timestamp":1602115200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,10,8]],"date-time":"2020-10-08T00:00:00Z","timestamp":1602115200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,10,8]],"date-time":"2020-10-08T00:00:00Z","timestamp":1602115200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,10,8]]},"DOI":"10.1109\/icstcc50638.2020.9259693","type":"proceedings-article","created":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T00:00:37Z","timestamp":1606176037000},"page":"124-129","source":"Crossref","is-referenced-by-count":3,"title":["An Experimental Comparison of Implementations of Dijkstra\u2019s Single Source Shortest Path Algorithm Using Different Priority Queues Data Structures"],"prefix":"10.1109","author":[{"given":"Andrei-Daniel","family":"Andreiana","sequence":"first","affiliation":[]},{"given":"Costin","family":"Badica","sequence":"additional","affiliation":[]},{"given":"Eugen","family":"Ganea","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.oceaneng.2019.106131"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.pss.2019.104707"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.compag.2015.12.002"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.01.007"},{"article-title":"Priority Queues and Dijkstra’s Algorithm","year":"2007","author":"chen","key":"ref14"},{"article-title":"Fibonacci Heap","year":"2020","author":"tran","key":"ref15"},{"article-title":"fibonacci-heap-python","year":"2020","author":"borowski","key":"ref16"},{"year":"2020","author":"schwarz","key":"ref17"},{"article-title":"dijkstra-python","year":"2020","author":"andreiana","key":"ref18"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/6617.6621"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.1016\/j.amc.2006.06.094","article-title":"An improved Dijkstra’s shortest path algorithm for sparse network","author":"xu","year":"2007","journal-title":"Applied Mathematics and Computation"},{"article-title":"Introduction to Algorithms","year":"2009","author":"cormen","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/102435"},{"article-title":"Network Flow Theory","year":"1956","author":"ford","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"article-title":"Handbook of Computational Geometry","year":"2000","author":"mitchell","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2017.01.001"}],"event":{"name":"2020 24th International Conference on System Theory, Control and Computing (ICSTCC)","start":{"date-parts":[[2020,10,8]]},"location":"Sinaia, Romania","end":{"date-parts":[[2020,10,10]]}},"container-title":["2020 24th International Conference on System Theory, Control and Computing (ICSTCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9259608\/9259629\/09259693.pdf?arnumber=9259693","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T00:13:01Z","timestamp":1656375181000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9259693\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,8]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/icstcc50638.2020.9259693","relation":{},"subject":[],"published":{"date-parts":[[2020,10,8]]}}}