{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T16:19:27Z","timestamp":1756570767051,"version":"3.41.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031976476"},{"type":"electronic","value":"9783031976483"}],"license":[{"start":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T00:00:00Z","timestamp":1751068800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T00:00:00Z","timestamp":1751068800000},"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":[[2026]]},"DOI":"10.1007\/978-3-031-97648-3_13","type":"book-chapter","created":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T10:29:14Z","timestamp":1751711354000},"page":"191-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Extending the Shortest Path Algorithm for Large Graphs with Cycles and Parallel Computing Capabilities"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4385-1916","authenticated-orcid":false,"given":"Muon","family":"Ha","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7140-1686","authenticated-orcid":false,"given":"Yulia","family":"Shichkina","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1552-1867","authenticated-orcid":false,"given":"Xuan-Hien","family":"Nguyen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,28]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Shichkina, Y., Nguyen, X.H., Ha, M., Tran, D.M.: Shortest path search method on a graph with cycles. In: Gervasi, O., Murgante, B., Garau, C., Taniar, D., C. Rocha, A.M.A., Faginas Lago, M.N. (eds.) Computational Science and Its Applications \u2013 ICCSA 2024 Workshops. ICCSA 2024. Lecture Notes in Computer Science, vol. 14825. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-65343-8_26","key":"13_CR1","DOI":"10.1007\/978-3-031-65343-8_26"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959). https:\/\/doi.org\/10.1007\/BF01386390","journal-title":"Numer. Math."},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R Bellman","year":"1958","unstructured":"Bellman, R.: On a routing problem. Q. Appl. Math. 16(1), 87\u201390 (1958)","journal-title":"Q. Appl. Math."},{"doi-asserted-by":"publisher","unstructured":"Qiu, L., Li, Z., Ke, X., Chen, L., Gao, Y.: Accelerating biclique counting on GPU. In: Proceedings of the 40th IEEE International Conference on Data Engineering (ICDE 2024), pp. 3191\u20133203. IEEE, Utrecht (2024). https:\/\/doi.org\/10.1109\/ICDE60146.2024.00247","key":"13_CR4","DOI":"10.1109\/ICDE60146.2024.00247"},{"doi-asserted-by":"publisher","unstructured":"Verma, D., Messon, D., Rastogi, M., Singh, A.: Comparative study of various approaches of Dijkstra algorithm. In: Proceedings of the 2021 International Conference on Computing, Communication, and Intelligent Systems (ICCCIS 2021), pp. 328\u2013336. IEEE, Greater Noida (2021). https:\/\/doi.org\/10.1109\/ICCCIS51004.2021.9397200","key":"13_CR5","DOI":"10.1109\/ICCCIS51004.2021.9397200"},{"doi-asserted-by":"crossref","unstructured":"Shyma, P.V., Sanil, S.K.P.: Degree-based search: a novel graph traversal algorithm using degree-based priority queues. Int. J. Adv. Comput. Sci. Appl. 15(7), 1366\u20131371 (2024). https:\/\/api.semanticscholar.org\/CorpusID:271699515","key":"13_CR6","DOI":"10.14569\/IJACSA.2024.01507132"},{"doi-asserted-by":"publisher","unstructured":"Sridhar, U., Blanco, M.P., Mayuranath, R., Spampinato, D.G., Low, T.M., McMillan, S.: Delta-stepping SSSP: from vertices and edges to GraphBLAS implementations. In: Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW 2019), pp. 241\u2013250. IEEE, Rio de Janeiro (2019). https:\/\/doi.org\/10.1109\/IPDPSW.2019.00047","key":"13_CR7","DOI":"10.1109\/IPDPSW.2019.00047"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1186\/s13638-020-01680-x","volume":"2020","author":"B Zhang","year":"2020","unstructured":"Zhang, B., Hu, D.J.: RETRACTED ARTICLE: Research on the construction and simulation of PO-Dijkstra algorithm model in parallel network of multicore platform. J. Wirel. Commun. Netw. 2020, 85 (2020). https:\/\/doi.org\/10.1186\/s13638-020-01680-x","journal-title":"J. Wirel. Commun. Netw."},{"doi-asserted-by":"publisher","unstructured":"Safari, M., Oortwijn, W., Huisman, M.: Automated verification of the parallel Bellman\u2013Ford algorithm. In: Dr\u0103goi, C., Mukherjee, S., Namjoshi, K. (eds.) Static Analysis. SAS 2021. Lecture Notes in Computer Science(), vol. 12913. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88806-0_17","key":"13_CR9","DOI":"10.1007\/978-3-030-88806-0_17"},{"doi-asserted-by":"publisher","unstructured":"Aher, S.N., Walunj, S.M.: Accelerate the execution of graph processing using GPU. In: Satapathy, S., Joshi, A. (eds.) Information and Communication Technology for Intelligent Systems. Smart Innovation, Systems and Technologies, vol. 106. Springer, Singapore (2019). https:\/\/doi.org\/10.1007\/978-981-13-1742-2_13","key":"13_CR10","DOI":"10.1007\/978-981-13-1742-2_13"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1137\/22M1523790","volume":"34","author":"T Marcucci","year":"2024","unstructured":"Marcucci, T., Umenberger, J., Parrilo, P., Tedrake, R.: Shortest paths in graphs of convex sets. SIAM J. Optim. 34(1), 507\u2013532 (2024). https:\/\/doi.org\/10.1137\/22M1523790","journal-title":"SIAM J. Optim."},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.comcom.2019.10.011","volume":"149","author":"J Bhatia","year":"2020","unstructured":"Bhatia, J., Dave, R., Bhayani, H., Tanwar, S., Nayyar, A.: SDN-based real-time urban traffic analysis in VANET environment. Comput. Commun. 149, 162\u2013175 (2020). https:\/\/doi.org\/10.1016\/j.comcom.2019.10.011","journal-title":"Comput. Commun."},{"issue":"7","key":"13_CR13","doi-asserted-by":"publisher","first-page":"5567","DOI":"10.1109\/TIE.2018.2869345","volume":"66","author":"H Mostafaei","year":"2019","unstructured":"Mostafaei, H.: Energy-efficient algorithm for reliable routing of wireless sensor networks. IEEE Trans. Industr. Electron. 66(7), 5567\u20135575 (2019). https:\/\/doi.org\/10.1109\/TIE.2018.2869345","journal-title":"IEEE Trans. Industr. Electron."},{"doi-asserted-by":"publisher","unstructured":"Joshi, S., Shanmuganathan, M., Aljuhani, A., Albalawi, U., Aljaedi, A.: Energy-efficient and secure wireless communication for telemedicine in IoT. Comput. Syst. Sci. Eng. 43, 1111\u20131130 (2022). https:\/\/doi.org\/10.32604\/csse.2022.024802","key":"13_CR14","DOI":"10.32604\/csse.2022.024802"},{"doi-asserted-by":"publisher","unstructured":"\u0160umak, B., Pu\u0161nik, M.: Analysis of the Shortest Path Method Application in Social Networks. In: Information Modelling and Knowledge Bases XXXIV, pp. 169\u2013182. IOS Press (2023). https:\/\/doi.org\/10.3233\/FAIA220500","key":"13_CR15","DOI":"10.3233\/FAIA220500"},{"issue":"5","key":"13_CR16","doi-asserted-by":"publisher","first-page":"470","DOI":"10.3390\/math705047","volume":"7","author":"C Zuo","year":"2019","unstructured":"Zuo, C., Pal, A., Dey, A.: New concepts of picture fuzzy graphs with application. Mathematics 7(5), 470 (2019). https:\/\/doi.org\/10.3390\/math705047","journal-title":"Mathematics"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2025 Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-97648-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T10:29:15Z","timestamp":1751711355000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97648-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,28]]},"ISBN":["9783031976476","9783031976483"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97648-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,6,28]]},"assertion":[{"value":"28 June 2025","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":"Istanbul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"T\u00fcrkiye","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}