{"id":"https://openalex.org/W2110004664","doi":"https://doi.org/10.1145/1824777.1824784","title":"A near-linear-time algorithm for computing replacement paths in planar directed graphs","display_name":"A near-linear-time algorithm for computing replacement paths in planar directed graphs","publication_year":2010,"publication_date":"2010-08-01","ids":{"openalex":"https://openalex.org/W2110004664","doi":"https://doi.org/10.1145/1824777.1824784","mag":"2110004664"},"language":"en","primary_location":{"id":"doi:10.1145/1824777.1824784","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1824777.1824784","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-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/A5000264005","display_name":"Yuval Emek","orcid":"https://orcid.org/0000-0002-3123-3451"},"institutions":[{"id":"https://openalex.org/I4210125051","display_name":"Microsoft (Israel)","ror":"https://ror.org/03819cc96","country_code":"IL","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210125051"]},{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Yuval Emek","raw_affiliation_strings":["Microsoft Israel R&D Center, Herzlia, Israel","The Weizmann Institute of Science, Rehovot, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Israel R&D Center, Herzlia, Israel","institution_ids":["https://openalex.org/I4210125051"]},{"raw_affiliation_string":"The Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056419022","display_name":"David Peleg","orcid":"https://orcid.org/0000-0003-1590-0506"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"David Peleg","raw_affiliation_strings":["Weizmann Institute of Science, Rehovot, Israel","The Weizmann Institute of Science, Rehovot, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]},{"raw_affiliation_string":"The Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076616592","display_name":"Liam Roditty","orcid":null},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]},{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Liam Roditty","raw_affiliation_strings":["Bar Ilan University, Ramat Gan, Israel","The Weizmann Institute of Science, Rehovot, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bar Ilan University, Ramat Gan, Israel","institution_ids":["https://openalex.org/I13955877"]},{"raw_affiliation_string":"The Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5000264005"],"corresponding_institution_ids":["https://openalex.org/I4210125051","https://openalex.org/I53964585"],"apc_list":null,"apc_paid":null,"fwci":2.4027,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.88930422,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"6","issue":"4","first_page":"1","last_page":"13"},"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.9994999766349792,"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.9994999766349792,"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/T12288","display_name":"Optimization and Search Problems","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.996399998664856,"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/algorithm","display_name":"Algorithm","score":0.6123119592666626},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.57975172996521},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.5528054237365723},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5404021143913269},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5374755263328552},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5163553953170776},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.515942394733429},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47394517064094543},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.43368491530418396},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42992621660232544},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4251050055027008},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3775855004787445},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37607160210609436},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.16826722025871277}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6123119592666626},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.57975172996521},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.5528054237365723},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5404021143913269},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5374755263328552},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5163553953170776},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.515942394733429},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47394517064094543},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.43368491530418396},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42992621660232544},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4251050055027008},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3775855004787445},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37607160210609436},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.16826722025871277},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1824777.1824784","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1824777.1824784","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.107.600","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.600","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.wisdom.weizmann.ac.il/~liamr/papers/near-linear-time.pdf","raw_type":"text"},{"id":"mag:2110004664","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/soda/soda2008.html#EmekPR08","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1498660721","https://openalex.org/W1773616669","https://openalex.org/W1947899203","https://openalex.org/W1978228527","https://openalex.org/W1980943820","https://openalex.org/W1984407615","https://openalex.org/W1999483000","https://openalex.org/W1999545213","https://openalex.org/W2011282943","https://openalex.org/W2012634103","https://openalex.org/W2066423045","https://openalex.org/W2078443814","https://openalex.org/W2078948975","https://openalex.org/W2080237261","https://openalex.org/W2096304547","https://openalex.org/W2121601357","https://openalex.org/W2131058166","https://openalex.org/W2133768189","https://openalex.org/W2134729426","https://openalex.org/W2169528473","https://openalex.org/W2752885492","https://openalex.org/W4245095675","https://openalex.org/W6669884786"],"related_works":["https://openalex.org/W2992182984","https://openalex.org/W2134729426","https://openalex.org/W1988593903","https://openalex.org/W1980943820","https://openalex.org/W1638683514","https://openalex.org/W3037212114","https://openalex.org/W2795850823","https://openalex.org/W3098776817","https://openalex.org/W3034281291","https://openalex.org/W1604585469","https://openalex.org/W1485876617","https://openalex.org/W1975344016","https://openalex.org/W1426993502","https://openalex.org/W2522844978","https://openalex.org/W1978228527","https://openalex.org/W1773616669","https://openalex.org/W1525471909","https://openalex.org/W2081433495","https://openalex.org/W1972455324","https://openalex.org/W2538469359"],"abstract_inverted_index":{"Let":[0],"(":[1,4,111,180,182,268,283,385],"G":[2,29],"=":[3,122,128,281],"V(G)":[5,124],",":[6,47],"E(G)":[7,130],"))":[8],"be":[9,20,201,336,410],"a":[10,21,51,242,301,314,370,374],"directed":[11,72,159,253,328],"graph":[12,86,100],"with":[13,313],"nonnegative":[14],"edge":[15,43,79],"lengths":[16,261],"and":[17,90,126,214],"let":[18],"P":[19,46,81],"shortest":[22,52,152,323],"path":[23,53,353,380],"from":[24,54,84,93,154,170],"s":[25,55,94,155,171],"to":[26,39,56,95,147,156,172,203,222,338],"t":[27,57,96,157,173],"in":[28,45,70,80,87,97,158,197,233,250,266,277,326,330,345,350,369,382,395,406],".":[30,61,174],"In":[31,237,255,362,399],"the":[32,48,68,75,85,91,98,144,149,167,190,204,224,229,234,257,260,263,290,294,340,343,351,357,360,365,391,396,404],"replacement":[33,133,168,205,248,264,352,379,397],"paths":[34,134,153,169,206,249,265,324],"problem":[35,69,135,344],"we":[36,240,401],"are":[37],"required":[38],"compute":[40,148,223],"for":[41,66,246],"every":[42],"e":[44,60],"length":[49,358],"of":[50,106,192,195,262,293,317,342,359,393,413],"that":[58,276,320,363,377],"avoids":[59],"The":[62,103,132],"fastest":[63,145],"known":[64],"algorithm":[65,108,146,231,245,258,305,334,366],"solving":[67],"weighted":[71,251],"graphs":[73,160,279,329],"is":[74,82,101,109,136,178,220,306,348,367,390],"trivial":[76,230],"one:":[77],"each":[78],"removed":[83],"its":[88],"turn":[89],"distance":[92],"modified":[99],"computed.":[102],"running":[104,176,291],"time":[105,177,244,274,292,383],"this":[107,238],"O":[110,179,267,282],"m":[112,127,183,280],"n":[113,115,118,121,185,187,269,272,284],"+":[114,184],"2":[116],"log":[117,186,270],"),":[119,387],"where":[120,388],"|":[123,125,129],"|.":[131],"strongly":[137],"motivated":[138],"by":[139,212,299,308],"two":[140,295],"different":[141],"applications.":[142],"First,":[143],"k":[150],"simple":[151],"[Yen":[161],"1971;":[162],"Lawler":[163],"1972]":[164],"repeatedly":[165],"computes":[166,259],"Its":[175],"kn":[181],")).":[188,285],"Second,":[189],"computation":[191],"Vickrey":[193,225],"pricing":[194,226],"edges":[196],"distributed":[198],"networks":[199],"can":[200,335,402],"reduced":[202],"problem.":[207],"An":[208],"open":[209],"question":[210],"raised":[211],"Nisan":[213],"Ronen":[215],"[2001]":[216],"asks":[217],"whether":[218],"it":[219],"possible":[221],"faster":[227],"than":[228,356],"described":[232],"previous":[235],"paragraph.":[236],"article":[239],"present":[241],"near-linear":[243],"computing":[247],"planar":[252,278,327],"graphs.":[254],"particular,":[256],"3":[271],")":[273],"(recall":[275],"This":[286],"result":[287],"immediately":[288],"improves":[289],"applications":[296],"mentioned":[297],"before":[298],"almost":[300],"linear":[302],"factor.":[303],"Our":[304,333],"obtained":[307],"combining":[309],"several":[310],"new":[311],"ideas":[312],"data":[315,375],"structure":[316,376],"Klein":[318],"[2005]":[319],"supports":[321,378],"multisource":[322],"queries":[325,381],"logarithmic":[331],"time.":[332],"adapted":[337],"address":[339],"variant":[341,405],"which":[346,407],"one":[347],"interested":[349],"itself":[354],"(rather":[355],"path).":[361],"case":[364],"executed":[368],"preprocessing":[371],"stage":[372],"constructing":[373],"\u00d5":[384],"h":[386,389],"number":[392],"hops":[394],"path.":[398],"addition,":[400],"handle":[403],"vertices":[408],"should":[409],"avoided":[411],"instead":[412],"edges.":[414]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}