{"id":"https://openalex.org/W3137352489","doi":"https://doi.org/10.1109/bigdata50022.2020.9378056","title":"Approximately and Efficiently Estimating Dynamic Point-to-Point Shortest Path","display_name":"Approximately and Efficiently Estimating Dynamic Point-to-Point Shortest Path","publication_year":2020,"publication_date":"2020-12-10","ids":{"openalex":"https://openalex.org/W3137352489","doi":"https://doi.org/10.1109/bigdata50022.2020.9378056","mag":"3137352489"},"language":"en","primary_location":{"id":"doi:10.1109/bigdata50022.2020.9378056","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata50022.2020.9378056","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Conference on Big Data (Big Data)","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/A5052977304","display_name":"Alok Ranjan Tripathy","orcid":"https://orcid.org/0000-0001-9494-8641"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Alok Tripathy","raw_affiliation_strings":["University of California, Berkeley"],"affiliations":[{"raw_affiliation_string":"University of California, Berkeley","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086521826","display_name":"Oded Green","orcid":"https://orcid.org/0000-0003-3658-1233"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Oded Green","raw_affiliation_strings":["Georgia Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5052977304"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":0.1515,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.48380513,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"3015","last_page":"3024"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9987999796867371,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9987999796867371,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.998199999332428,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9926000237464905,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.7326157689094543},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.661424994468689},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.6052955985069275},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.5814467668533325},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5274320244789124},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5149967670440674},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.4193086624145508},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4185667037963867},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4148884415626526},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4114154577255249},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4078904390335083},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4067533612251282},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37166208028793335},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.3519405126571655},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2662166357040405},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.16206732392311096}],"concepts":[{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.7326157689094543},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.661424994468689},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.6052955985069275},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.5814467668533325},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5274320244789124},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5149967670440674},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.4193086624145508},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4185667037963867},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4148884415626526},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4114154577255249},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4078904390335083},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4067533612251282},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37166208028793335},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.3519405126571655},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2662166357040405},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.16206732392311096}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bigdata50022.2020.9378056","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata50022.2020.9378056","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Conference on Big Data (Big Data)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1526020079","https://openalex.org/W1530560842","https://openalex.org/W1554407673","https://openalex.org/W1556784394","https://openalex.org/W1603540962","https://openalex.org/W1991778515","https://openalex.org/W2029706450","https://openalex.org/W2036977244","https://openalex.org/W2064737680","https://openalex.org/W2067674168","https://openalex.org/W2088961699","https://openalex.org/W2096544401","https://openalex.org/W2097458838","https://openalex.org/W2129666400","https://openalex.org/W2151400766","https://openalex.org/W2172107427","https://openalex.org/W2250978763","https://openalex.org/W2263157912","https://openalex.org/W2539828367","https://openalex.org/W2557279889","https://openalex.org/W2755088640","https://openalex.org/W2902093742","https://openalex.org/W2963957156","https://openalex.org/W4214773521"],"related_works":["https://openalex.org/W2382250366","https://openalex.org/W3137352489","https://openalex.org/W2002764510","https://openalex.org/W2779966368","https://openalex.org/W2163460271","https://openalex.org/W1669209377","https://openalex.org/W2004635739","https://openalex.org/W4224021803","https://openalex.org/W1600015977","https://openalex.org/W2092243261"],"abstract_inverted_index":{"Point-to-point":[0],"shortest":[1,12,38,76,154],"path":[2,13,39,77,155],"(PPSP),":[3],"or":[4,114],"s-t":[5],"connectivity,":[6],"is":[7,36],"a":[8,25,121,136,184],"variant":[9],"of":[10,29,43,67,146,192],"the":[11,34,37,57,75,79,86,104,111,127,143,153,168,189,207,215,223],"problem":[14,59],"found":[15],"in":[16,103,186],"graph":[17,26,128,164,200,208,217],"theory.":[18],"In":[19,45],"this":[20,46],"problem,":[21],"we":[22,48,195],"are":[23],"given":[24],"and":[27,33,72,150,152,178],"pairs":[28],"vertices":[30,68,172],"over":[31],"time,":[32],"output":[35],"between":[40,78,148,170],"each":[41,65,141,157,220],"pair":[42,66],"vertices.":[44,81],"paper,":[47],"present":[49],"two":[50,80,171],"algorithms.":[51],"Our":[52,82],"first":[53,87],"algorithm":[54,84,97,165,201,218],"approximately":[55],"solves":[56],"PPSP":[58],"on":[60,90,110,117],"any":[61],"arbitrary":[62],"graph.":[63,224],"For":[64],"queried,":[69],"it":[70],"accurately":[71],"efficiently":[73,99],"estimates":[74],"second":[83,96],"extends":[85],"to":[88,135,206,222],"work":[89],"dynamic":[91,199],"graphs.":[92],"That":[93],"is,":[94],"our":[95,162,198],"can":[98,166,202],"account":[100,203],"for":[101,204,219],"changes":[102],"graph,":[105],"such":[106],"as":[107],"friend":[108],"requests":[109],"Facebook":[112],"network":[113],"road":[115,118],"closures":[116],"networks.":[119],"At":[120],"high":[122],"level,":[123],"both":[124],"algorithms":[125],"partition":[126],"into":[129],"highly":[130],"connected":[131],"communities.":[132],"To":[133],"respond":[134],"query":[137],"q(u,":[138],"v),":[139],"they":[140],"find":[142],"fewest":[144],"number":[145],"partitions":[147],"u":[149],"v,":[151],"through":[156],"partition.":[158],"We":[159],"show":[160,196],"that":[161,197],"static":[163,216],"approximate":[167],"distance":[169],"with":[173,188],"about":[174],"20%-35%":[175],"percent":[176],"error":[177],"anywhere":[179,209],"from":[180,210],"80X-70000X":[181],"faster":[182,212],"than":[183,213],"BFS":[185],"practice":[187],"right":[190],"choice":[191],"partitions.":[193],"Additionally,":[194],"updates":[205],"20X-20000X":[211],"rerunning":[214],"change":[221]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}