{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T04:57:23Z","timestamp":1761368243108,"version":"build-2065373602"},"reference-count":17,"publisher":"IEEE","license":[{"start":{"date-parts":[[2017,9,1]],"date-time":"2017-09-01T00:00:00Z","timestamp":1504224000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,9,1]],"date-time":"2017-09-01T00:00:00Z","timestamp":1504224000000},"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":[[2017,9]]},"DOI":"10.1109\/icacci.2017.8126138","type":"proceedings-article","created":{"date-parts":[[2017,12,4]],"date-time":"2017-12-04T17:26:11Z","timestamp":1512408371000},"page":"2000-2004","source":"Crossref","is-referenced-by-count":1,"title":["All pair shortest path using distributed architectures"],"prefix":"10.1109","author":[{"given":"Sakshi","family":"Vaid","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering Amrita School of Engineering, Amritapuri, Amrita Vishwa Vidyapeetham, Amrita University, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rene","family":"Salih","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering Amrita School of Engineering, Amritapuri, Amrita Vishwa Vidyapeetham, Amrita University, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. G.","family":"Gayathri","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering Amrita School of Engineering, Amritapuri, Amrita Vishwa Vidyapeetham, Amrita University, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jyothisha J","family":"Nair","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering Amrita School of Engineering, Amritapuri, Amrita Vishwa Vidyapeetham, Amrita University, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","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":"Numerische Mathematik"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321993"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332504"},{"journal-title":"An optimal distributed algorithm for All pairs shortest path","author":"Saroja","key":"ref4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"ref6","article-title":"An all-pairs shortest-path distributed algorithm, Res. Rep. RC-8327","author":"Toueg","year":"1980","journal-title":"IBM Thomas J. Watson Research Center, Yorktown Heights, N.Y."},{"key":"ref7","first-page":"271","article-title":"A decentralized shortest path algorithm","volume-title":"Proc. of the 16th Allerton Conf. on Communication, Control, and Computing (Monticello, I11.)","author":"Abram"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28421"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2016.07.297"},{"key":"ref10","article-title":"A distributed algorithm for finding the shortest paths in an undirected graph","volume-title":"Technical Report CS-86\u201313, Department of Compute Science, Pennsylvania State University","author":"Ravichandran","year":"1986"},{"key":"ref11","first-page":"833","author":"Chandry","year":"1982","journal-title":"Distributed computation on graphs: shortest path algorithms, Comm. ACM 25"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2015.02.008"},{"issue":"69","key":"ref13","first-page":"222","volume":"10","author":"Gayathri","journal-title":"Towards efficient analysis of massive networks (2015) International Journal of Applied Engineering Research"},{"key":"ref14","article-title":"Shortest Paths Algorithms: Theory and Experimental Evaluation","author":"Cherkassy","year":"1993","journal-title":"Research project, Department of Computer Science, Cornell and Stanford Universities and Krasikova Institute for Economics and Mathematics"},{"issue":"6","key":"ref15","first-page":"99","article-title":"A review and evaluations of shortest path algorithms","volume":"2","author":"Kairanbay","year":"2013","journal-title":"International journal of scientific technologyresearch"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.12988\/ams.2015.5121"},{"article-title":"Real Time Vehicular Data Analysis utilising Big Data Platforms on Cost Effective ECU Networks","volume-title":"International Conference on Innovation in Information Embedded and Communication Systems (ICIIECS\u2018 16)","author":"Nair","key":"ref18"}],"event":{"name":"2017 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","start":{"date-parts":[[2017,9,13]]},"location":"Udupi, India","end":{"date-parts":[[2017,9,16]]}},"container-title":["2017 International Conference on Advances in Computing, Communications and Informatics (ICACCI)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8119306\/8125802\/08126138.pdf?arnumber=8126138","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T04:53:40Z","timestamp":1761368020000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8126138\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/icacci.2017.8126138","relation":{},"subject":[],"published":{"date-parts":[[2017,9]]}}}