{"id":"https://openalex.org/W2775617364","doi":"https://doi.org/10.1109/icacci.2017.8126138","title":"All pair shortest path using distributed architectures","display_name":"All pair shortest path using distributed architectures","publication_year":2017,"publication_date":"2017-09-01","ids":{"openalex":"https://openalex.org/W2775617364","doi":"https://doi.org/10.1109/icacci.2017.8126138","mag":"2775617364"},"language":"en","primary_location":{"id":"doi:10.1109/icacci.2017.8126138","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icacci.2017.8126138","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054461966","display_name":"Sakshi Vaid","orcid":null},"institutions":[{"id":"https://openalex.org/I81556334","display_name":"Amrita Vishwa Vidyapeetham","ror":"https://ror.org/03am10p12","country_code":"IN","type":"education","lineage":["https://openalex.org/I81556334"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sakshi Vaid","raw_affiliation_strings":["Department of Computer Science and Engineering Amrita School of Engineering, Amritapuri, Amrita Vishwa Vidyapeetham, Amrita University, India","Department of Computer Science and Engineering, Amrita Vishwa Vidyapeetham, Amrita University, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering Amrita School of Engineering, Amritapuri, Amrita Vishwa Vidyapeetham, Amrita University, India","institution_ids":["https://openalex.org/I81556334"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Amrita Vishwa Vidyapeetham, Amrita University, India","institution_ids":["https://openalex.org/I81556334"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060422916","display_name":"Rene Salih","orcid":null},"institutions":[{"id":"https://openalex.org/I81556334","display_name":"Amrita Vishwa Vidyapeetham","ror":"https://ror.org/03am10p12","country_code":"IN","type":"education","lineage":["https://openalex.org/I81556334"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Rene Salih","raw_affiliation_strings":["Department of Computer Science and Engineering Amrita School of Engineering, Amritapuri, Amrita Vishwa Vidyapeetham, Amrita University, India","Department of Computer Science and Engineering, Amrita Vishwa Vidyapeetham, Amrita University, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering Amrita School of Engineering, Amritapuri, Amrita Vishwa Vidyapeetham, Amrita University, India","institution_ids":["https://openalex.org/I81556334"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Amrita Vishwa Vidyapeetham, Amrita University, India","institution_ids":["https://openalex.org/I81556334"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048118020","display_name":"R. Gayathri","orcid":null},"institutions":[{"id":"https://openalex.org/I81556334","display_name":"Amrita Vishwa Vidyapeetham","ror":"https://ror.org/03am10p12","country_code":"IN","type":"education","lineage":["https://openalex.org/I81556334"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"R. G. Gayathri","raw_affiliation_strings":["Department of Computer Science and Engineering Amrita School of Engineering, Amritapuri, Amrita Vishwa Vidyapeetham, Amrita University, India","Department of Computer Science and Engineering, Amrita Vishwa Vidyapeetham, Amrita University, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering Amrita School of Engineering, Amritapuri, Amrita Vishwa Vidyapeetham, Amrita University, India","institution_ids":["https://openalex.org/I81556334"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Amrita Vishwa Vidyapeetham, Amrita University, India","institution_ids":["https://openalex.org/I81556334"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041549614","display_name":"Jyothisha J. Nair","orcid":"https://orcid.org/0000-0002-8050-8896"},"institutions":[{"id":"https://openalex.org/I81556334","display_name":"Amrita Vishwa Vidyapeetham","ror":"https://ror.org/03am10p12","country_code":"IN","type":"education","lineage":["https://openalex.org/I81556334"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Jyothisha J Nair","raw_affiliation_strings":["Department of Computer Science and Engineering Amrita School of Engineering, Amritapuri, Amrita Vishwa Vidyapeetham, Amrita University, India","Department of Computer Science and Engineering, Amrita Vishwa Vidyapeetham, Amrita University, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering Amrita School of Engineering, Amritapuri, Amrita Vishwa Vidyapeetham, Amrita University, India","institution_ids":["https://openalex.org/I81556334"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Amrita Vishwa Vidyapeetham, Amrita University, India","institution_ids":["https://openalex.org/I81556334"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.18683571,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"2000","last_page":"2004"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.794052243232727},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7755563259124756},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.653160572052002},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.6364619135856628},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5983272790908813},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.515472948551178},{"id":"https://openalex.org/keywords/average-path-length","display_name":"Average path length","score":0.5015819072723389},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.49721601605415344},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.48079055547714233},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.4700799286365509},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4583245515823364},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4379594326019287},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.4147791564464569},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3352981507778168},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16671928763389587}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.794052243232727},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7755563259124756},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.653160572052002},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6364619135856628},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5983272790908813},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.515472948551178},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.5015819072723389},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.49721601605415344},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.48079055547714233},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.4700799286365509},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4583245515823364},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4379594326019287},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4147791564464569},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3352981507778168},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16671928763389587},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icacci.2017.8126138","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icacci.2017.8126138","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1996805805","https://openalex.org/W2007572995","https://openalex.org/W2022980325","https://openalex.org/W2041356704","https://openalex.org/W2053788000","https://openalex.org/W2097740541","https://openalex.org/W2150437713","https://openalex.org/W2169528473","https://openalex.org/W2202303318","https://openalex.org/W2466020225","https://openalex.org/W2513153275","https://openalex.org/W2977275967","https://openalex.org/W6719395517","https://openalex.org/W7052322119"],"related_works":["https://openalex.org/W2375775343","https://openalex.org/W2002764510","https://openalex.org/W2237480599","https://openalex.org/W2156431668","https://openalex.org/W2020255949","https://openalex.org/W2369379323","https://openalex.org/W2089338760","https://openalex.org/W2144050074","https://openalex.org/W2531277291","https://openalex.org/W2359382971"],"abstract_inverted_index":{"Due":[0],"to":[1,13,33,61,141],"the":[2,17,23,38,55,62,83,98,113,118,124,129,143,147,160],"explosion":[3],"of":[4,40,57,100,159],"data":[5,9,58],"from":[6],"various":[7,80],"sources,":[8],"analytics":[10,50],"is":[11,51,91,163],"found":[12],"be":[14],"difficult":[15],"using":[16,28,112,123],"CPU":[18],"alone.":[19],"For":[20],"huge":[21],"networks,":[22],"most":[24],"popular":[25],"graph":[26,90],"algorithms":[27,41],"a":[29,89,108,152],"single":[30,134],"processor":[31],"failed":[32],"accomplish":[34],"this":[35,104],"task.":[36],"Hence":[37],"need":[39],"that":[42],"have":[43],"higher":[44],"processing":[45],"capabilities":[46],"became":[47],"dominant.":[48],"Graph":[49],"gaining":[52],"importance":[53],"in":[54,79,88,97,132,146],"realm":[56],"analysis":[59],"due":[60],"advantages":[63],"over":[64],"other":[65],"conventional":[66],"analytical":[67],"methods.":[68],"All":[69],"pair":[70,85,120],"shortest":[71,86,121,136],"path":[72,87,122,137],"problem":[73,76],"or":[74],"path-finding":[75],"has":[77],"applications":[78],"fields.":[81],"Finding":[82],"all":[84,119],"computationally":[92],"complex":[93],"and":[94,128],"time":[95],"consuming":[96],"case":[99],"large":[101],"networks.":[102],"In":[103,139],"paper,":[105],"we":[106,150],"propose":[107],"map":[109],"reduce":[110],"approach":[111],"in-memory":[114],"computation":[115],"for":[116],"finding":[117],"transitive":[125],"closure":[126],"property":[127],"greedy":[130],"technique":[131],"Dijkstra's":[133],"source":[135],"method.":[138],"order":[140],"overcome":[142],"scalability":[144],"issues":[145],"network":[148,155],"representation,":[149],"use":[151],"tuple":[153],"based":[154],"representation.":[156],"The":[157],"performance":[158],"proposed":[161],"method":[162],"proved":[164],"experimentally.":[165]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}