{"id":"https://openalex.org/W2002764510","doi":"https://doi.org/10.1109/icnsc.2014.6819670","title":"Distributed algorithm for shortest path problem via randomized strategy","display_name":"Distributed algorithm for shortest path problem via randomized strategy","publication_year":2014,"publication_date":"2014-04-01","ids":{"openalex":"https://openalex.org/W2002764510","doi":"https://doi.org/10.1109/icnsc.2014.6819670","mag":"2002764510"},"language":"en","primary_location":{"id":"doi:10.1109/icnsc.2014.6819670","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnsc.2014.6819670","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th IEEE International Conference on Networking, Sensing and Control","raw_type":"proceedings-article"},"type":"conference-paper","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/A5085550621","display_name":"Mohammadreza Doostmohammadian","orcid":"https://orcid.org/0000-0003-0959-6608"},"institutions":[{"id":"https://openalex.org/I121934306","display_name":"Tufts University","ror":"https://ror.org/05wvpxv85","country_code":"US","type":"education","lineage":["https://openalex.org/I121934306"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohammadreza Doostmohammadian","raw_affiliation_strings":["Electrical and Computer Engineering, Tufts University, Medford, MA","Electrical and Computer Engineering, Tufts University, Medford, MA 02155, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering, Tufts University, Medford, MA","institution_ids":["https://openalex.org/I121934306"]},{"raw_affiliation_string":"Electrical and Computer Engineering, Tufts University, Medford, MA 02155, USA","institution_ids":["https://openalex.org/I121934306"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065354410","display_name":"Sepideh Pourazarm","orcid":"https://orcid.org/0000-0002-4567-9980"},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sepideh Pourazarm","raw_affiliation_strings":["Systems Engineering, Boston University, Boston, MA","Systems Engineering, Boston University, MA 02115, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Systems Engineering, Boston University, Boston, MA","institution_ids":["https://openalex.org/I111088046"]},{"raw_affiliation_string":"Systems Engineering, Boston University, MA 02115, USA","institution_ids":["https://openalex.org/I111088046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025641667","display_name":"Usman A. Khan","orcid":"https://orcid.org/0000-0002-0853-6518"},"institutions":[{"id":"https://openalex.org/I121934306","display_name":"Tufts University","ror":"https://ror.org/05wvpxv85","country_code":"US","type":"education","lineage":["https://openalex.org/I121934306"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Usman A. Khan","raw_affiliation_strings":["Electrical and Computer Engineering, Tufts University, Medford, MA","Electrical and Computer Engineering, Tufts University, Medford, MA 02155, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering, Tufts University, Medford, MA","institution_ids":["https://openalex.org/I121934306"]},{"raw_affiliation_string":"Electrical and Computer Engineering, Tufts University, Medford, MA 02155, USA","institution_ids":["https://openalex.org/I121934306"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"463","last_page":"467"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/widest-path-problem","display_name":"Widest path problem","score":0.8183258771896362},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.8069173097610474},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.8064703941345215},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.722689688205719},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.7036707401275635},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.6913514733314514},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.5817590951919556},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.5770801901817322},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.5689877271652222},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5130130648612976},{"id":"https://openalex.org/keywords/average-path-length","display_name":"Average path length","score":0.48665863275527954},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4862307608127594},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.47832775115966797},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4640120267868042},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4576171934604645},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4011937379837036},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3224932551383972},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.2623867988586426},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1457953155040741},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.14492499828338623}],"concepts":[{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.8183258771896362},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8069173097610474},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.8064703941345215},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.722689688205719},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.7036707401275635},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.6913514733314514},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.5817590951919556},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.5770801901817322},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.5689877271652222},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5130130648612976},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.48665863275527954},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4862307608127594},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.47832775115966797},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4640120267868042},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4576171934604645},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4011937379837036},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3224932551383972},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2623867988586426},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1457953155040741},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.14492499828338623}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnsc.2014.6819670","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnsc.2014.6819670","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th IEEE International Conference on Networking, Sensing and Control","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":18,"referenced_works":["https://openalex.org/W2022980325","https://openalex.org/W2041172083","https://openalex.org/W2049407735","https://openalex.org/W2094099910","https://openalex.org/W2098865491","https://openalex.org/W2103052138","https://openalex.org/W2106308430","https://openalex.org/W2117905067","https://openalex.org/W2168148394","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2543118732","https://openalex.org/W2555049846","https://openalex.org/W3143219376","https://openalex.org/W4242243468","https://openalex.org/W4246219036","https://openalex.org/W4302033101","https://openalex.org/W6793127252"],"related_works":["https://openalex.org/W2237480599","https://openalex.org/W2018146256","https://openalex.org/W2002764510","https://openalex.org/W2198982833","https://openalex.org/W2183791707","https://openalex.org/W2163460271","https://openalex.org/W4293054712","https://openalex.org/W1994717376","https://openalex.org/W2388014219","https://openalex.org/W2348504720"],"abstract_inverted_index":{"In":[0,17],"this":[1,18],"paper,":[2],"we":[3,20,56,104],"introduce":[4],"a":[5,26,48,73,98],"distributed":[6],"algorithm":[7,59,92,111],"for":[8,14,64,93,112],"single":[9],"source":[10,28],"shortest":[11,23,45,62,70],"path":[12,24,46,49,63,71,74],"problem":[13],"undirected":[15,39],"graphs.":[16],"problem,":[19],"find":[21,61],"the":[22,34,44,58,69,81,86,90,106,110,120,126],"from":[25],"given":[27,91],"node":[29],"to":[30,60,125],"other":[31],"nodes":[32,133],"in":[33,42,67],"graph.":[35],"We":[36,84,117],"start":[37],"with":[38,50,75,114],"unweighted":[40],"graphs":[41,66,96,113],"which":[43,68],"is":[47,72,123],"minimum":[51,76],"number":[52,131],"of":[53,80,89,109,132],"edges.":[54],"Following,":[55],"modify":[57],"weighted":[65],"cost,":[77],"i.e.,":[78],"sum":[79],"edge":[82],"weights.":[83],"examine":[85],"convergence":[87],"time":[88],"random":[94,99],"Erd\u00f6s-R\u00e9nyi":[95],"as":[97,130],"variable;":[100],"based":[101],"on":[102],"that":[103,119],"approximate":[105],"stop-time":[107,121],"criteria":[108,122],"unknown":[115],"topology.":[116],"claim":[118],"related":[124],"graph":[127,135],"parameters":[128],"such":[129],"and":[134],"diameter.":[136]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}