{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T10:09:44Z","timestamp":1759226984144,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031653421"},{"type":"electronic","value":"9783031653438"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-65343-8_26","type":"book-chapter","created":{"date-parts":[[2024,7,29]],"date-time":"2024-07-29T15:03:47Z","timestamp":1722265427000},"page":"344-356","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Shortest Path Search Method on a Graph with Cycles"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7140-1686","authenticated-orcid":false,"given":"Yulia","family":"Shichkina","sequence":"first","affiliation":[]},{"given":"Xuan-Hien","family":"Nguyen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4385-1916","authenticated-orcid":false,"given":"Muon","family":"Ha","sequence":"additional","affiliation":[]},{"given":"Duc-Manh","family":"Tran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,30]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","unstructured":"Bast, H., et al.: Route planning in transportation networks. In: Kliemann, L., Sanders, P. (eds) Algorithm Engineering. LNCS, vol 9220. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49487-6_2","DOI":"10.1007\/978-3-319-49487-6_2"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"4155","DOI":"10.3390\/electronics12194155","volume":"12","author":"M Ha","year":"2023","unstructured":"Ha, M., Tran, D.-M., Shichkina, Y.: Model of message transmission across parallel route groups with dynamic alternation of these groups in a multichannel steganographic system. Electronics 12, 4155 (2023). https:\/\/doi.org\/10.3390\/electronics12194155","journal-title":"Electronics"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Zhao, X., Sala, A., Zheng, H., Zhao, B.Y.: Efficient shortest paths on massive social graphs. In: 7th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom), Orlando, FL, USA, pp. 77\u201386 (2011)","DOI":"10.4108\/icst.collaboratecom.2011.247162"},{"key":"26_CR4","unstructured":"Jasika, N., Alispahic, N., Elma, A., Ilvana, K., Elma, L., Nosovic, N.: Dijkstra's shortest path algorithm serial and parallel execution performance analysis. In: 2012 Proceedings of the 35th International Convention MIPRO, Opatija, Croatia, pp. 1811\u20131815 (2012)"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"2373","DOI":"10.1007\/s40747-021-00430-w","volume":"7","author":"M Parimala","year":"2021","unstructured":"Parimala, M., Broumi, S., Prakash, K., et al.: Bellman-Ford algorithm for solving shortest path problem of a network under picture fuzzy environment. Complex Intell. Syst. 7, 2373\u20132381 (2021). https:\/\/doi.org\/10.1007\/s40747-021-00430-w","journal-title":"Complex Intell. Syst."},{"key":"26_CR6","doi-asserted-by":"publisher","unstructured":"Candra, A., Budiman, M.A., Hartanto, K.: Dijkstra's and a-star in finding the shortest path: a tutorial. In: 2020 International Conference on Data Science, Artificial Intelligence, and Business Analytics (DATABIA), Medan, Indonesia, pp. 28\u201332 (2020). https:\/\/doi.org\/10.1109\/DATABIA50434.2020.9190342","DOI":"10.1109\/DATABIA50434.2020.9190342"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s40747-018-0083-y","volume":"5","author":"M Enayattabar","year":"2019","unstructured":"Enayattabar, M., Ebrahimnejad, A., Motameni, H.: Dijkstra algorithm for shortest path problem under interval-valued Pythagorean fuzzy environment. Complex Intell. Syst. 5, 93\u2013100 (2019). https:\/\/doi.org\/10.1007\/s40747-018-0083-y","journal-title":"Complex Intell. Syst."},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s40747-019-0101-8","volume":"5","author":"S Broumi","year":"2019","unstructured":"Broumi, S., Dey, A., Talea, M., et al.: Shortest path problem using Bellman algorithm under neutrosophic environment. Complex Intell. Syst. 5, 409\u2013416 (2019)","journal-title":"Complex Intell. Syst."},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Sao, P., Kannan, R., Gera, P., Vuduc, R.: A supernodal all-pairs shortest path algorithm. In: Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP \u201820), New York, NY, USA, pp. 250\u2013261. Association for Computing Machinery (2020)","DOI":"10.1145\/3332466.3374533"},{"key":"26_CR10","doi-asserted-by":"publisher","unstructured":"Rubin, F.: The lee path connection algorithm. IEEE Trans. Comput. C-23(9), 907\u2013914 (1974). https:\/\/doi.org\/10.1109\/T-C.1974.224054","DOI":"10.1109\/T-C.1974.224054"},{"key":"26_CR11","doi-asserted-by":"publisher","unstructured":"Hong, J., Park, K., Han, Y., Rasel, M.K., Vonvou, D., Lee, Y.-K.: Disk-based shortest path discovery using distance index over large dynamic graphs. Inf. Sci. 382\u2013383, 201\u2013215 (2017). ISSN 0020\u20130255, https:\/\/doi.org\/10.1016\/j.ins.2016.12.013","DOI":"10.1016\/j.ins.2016.12.013"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Singh, Y., Sharma, S., Sutton, R., Hatton, D.: Towards use of Dijkstra algorithm for optimal navigation of an unmanned surface vehicle in a real-time marine environment with results from artificial potential field. In: TransNav, the International Journal on Marine Navigation and Safety of Sea Transportation, vol. 12, no. 1 (2018)","DOI":"10.12716\/1001.12.01.14"},{"key":"26_CR13","doi-asserted-by":"publisher","unstructured":"Devi, B.R., Rao, K.K., Rani, M.A.: Application of modified bellman-ford algorithm for cooperative communication. Wireless Pers. Commun. 109, 2025\u20132049 (2019). https:\/\/doi.org\/10.1007\/s11277-019-06666-7","DOI":"10.1007\/s11277-019-06666-7"},{"key":"26_CR14","doi-asserted-by":"publisher","unstructured":"de las Casas, P.M., Sede\u00f1o-Noda, A., Bornd\u00f6rfer, R.: An improved multiobjective shortest path algorithm. Comput. Oper. Res. 135, 105424 (2021). ISSN 0305\u20130548, https:\/\/doi.org\/10.1016\/j.cor.2021.105424","DOI":"10.1016\/j.cor.2021.105424"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Qing, G., Zheng, Z. and Yue, X.: Path-planning of automated guided vehicle based on improved Dijkstra algorithm. In: 2017 29th Chinese Control And Decision Conference (CCDC), pp. 7138\u20137143, Chongqing, China (2017)","DOI":"10.1109\/CCDC.2017.7978471"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Asadi, S, Azimirad, V., Eslami, A., Ghanbari, A.: A novel global optimal path planning and trajectory method based on adaptive dijkstra-immune approach for mobile robot, In: 2011 IEEE\/ASME International Conference on Advanced Intelligent Mechatronics (AIM), pp. 1093\u20131098, Budapest, Hungary(2011)","DOI":"10.1109\/AIM.2011.6027073"},{"key":"26_CR17","doi-asserted-by":"publisher","unstructured":"Bogdan, P.: Dijkstra algorithm in parallel- Case study, In:\u00a0Proceedings of the 2015 16th International Carpathian Control Conference (ICCC), pp. 50\u201353, Szilvasvarad, Hungary (2015). https:\/\/doi.org\/10.1109\/CarpathianCC.2015.7145044","DOI":"10.1109\/CarpathianCC.2015.7145044"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Maleki, S., Nguyen, D., Lenharth, A., Garzar\u00e1n, M., Padua, D., Pingali, K.: DSMR: a parallel algorithm for single-source shortest path problem. In: Proceedings of the 2016 International Conference on Supercomputing (ICS \u201816), New York, Article 32, 1\u201314, NY, USA. Association for Computing Machinery (2016)","DOI":"10.1145\/2925426.2926287"},{"key":"26_CR19","doi-asserted-by":"publisher","unstructured":"Shichkina, Y., Kupriyanov, M.: Creating a schedule for parallel execution of tasks based on the adjacency lists. In: Galinina, O., Andreev, S., Balandin, S., Koucheryavy, Y. (eds.) NEW2AN ruSMART 2018 2018. LNCS, vol. 11118. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01168-0_10","DOI":"10.1007\/978-3-030-01168-0_10"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2024 Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-65343-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,29]],"date-time":"2024-07-29T15:07:37Z","timestamp":1722265657000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-65343-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031653421","9783031653438"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-65343-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"30 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hanoi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}