{"id":"https://openalex.org/W3184184852","doi":"https://doi.org/10.1145/3465084.3467913","title":"Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs","display_name":"Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs","publication_year":2021,"publication_date":"2021-07-21","ids":{"openalex":"https://openalex.org/W3184184852","doi":"https://doi.org/10.1145/3465084.3467913","mag":"3184184852"},"language":"en","primary_location":{"id":"doi:10.1145/3465084.3467913","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3465084.3467913","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing","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/A5036011801","display_name":"Greg Bodwin","orcid":"https://orcid.org/0000-0001-9896-8906"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Greg Bodwin","raw_affiliation_strings":["University of Michigan, Ann Arbor, MI, USA"],"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022875077","display_name":"Merav Parter","orcid":"https://orcid.org/0000-0002-2357-2445"},"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":"Merav Parter","raw_affiliation_strings":["Weizmann Institute of Science, Rehovot, Israel"],"affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036011801"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13140694,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"435","last_page":"443"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.998199999332428,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9975000023841858,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.8486863374710083},{"id":"https://openalex.org/keywords/concatenation","display_name":"Concatenation (mathematics)","score":0.6825716495513916},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.6731756925582886},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.6398155689239502},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6086490154266357},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5358214378356934},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5041137933731079},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.482384592294693},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47789061069488525},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.45397356152534485},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.43732571601867676},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43445006012916565},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.42687681317329407},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4259454309940338},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36593741178512573},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3438745141029358},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07907256484031677},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.05691400170326233}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8486863374710083},{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.6825716495513916},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.6731756925582886},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.6398155689239502},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6086490154266357},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5358214378356934},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5041137933731079},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.482384592294693},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47789061069488525},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.45397356152534485},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.43732571601867676},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43445006012916565},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.42687681317329407},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4259454309940338},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36593741178512573},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3438745141029358},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07907256484031677},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.05691400170326233},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3465084.3467913","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3465084.3467913","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6000000238418579,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1487962539","https://openalex.org/W1497822004","https://openalex.org/W1815926779","https://openalex.org/W1906469382","https://openalex.org/W1963633992","https://openalex.org/W1981234161","https://openalex.org/W2017675289","https://openalex.org/W2026486940","https://openalex.org/W2026798971","https://openalex.org/W2034501275","https://openalex.org/W2084427019","https://openalex.org/W2114946841","https://openalex.org/W2134729426","https://openalex.org/W2146522997","https://openalex.org/W2343281498","https://openalex.org/W2467525240","https://openalex.org/W2569680519","https://openalex.org/W2902306200","https://openalex.org/W2952064537","https://openalex.org/W2972150782","https://openalex.org/W3046727971","https://openalex.org/W3046809274","https://openalex.org/W4205300528","https://openalex.org/W4212817293","https://openalex.org/W4234410874","https://openalex.org/W4245095675","https://openalex.org/W4247564011","https://openalex.org/W4251704063","https://openalex.org/W6780163792"],"related_works":["https://openalex.org/W2156431668","https://openalex.org/W2018146256","https://openalex.org/W2040572217","https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W4293054712","https://openalex.org/W2352094194","https://openalex.org/W2612665926","https://openalex.org/W2183811469","https://openalex.org/W4294360851"],"abstract_inverted_index":{"The":[0],"restoration":[1],"lemma":[2,41],"by":[3,67],"Afek,":[4],"Bremler-Barr,":[5],"Kaplan,":[6],"Cohen,":[7],"and":[8],"Merritt":[9],"[Dist.":[10],"Comp.":[11],"'02]":[12],"proves":[13],"that,":[14],"in":[15],"an":[16,76],"undirected":[17],"unweighted":[18],"graph,":[19],"any":[20],"replacement":[21,65],"shortest":[22,37,50,71,83],"path":[23,51,84],"avoiding":[24],"a":[25,47,80],"failing":[26],"edge":[27],"can":[28,63],"be":[29],"expressed":[30],"as":[31,75],"the":[32,40],"concatenation":[33],"of":[34,82],"two":[35,69],"original":[36],"paths.":[38,72],"However,":[39],"is":[42,57,90],"tiebreaking-sensitive:":[43],"if":[44],"one":[45,62],"selects":[46],"particular":[48],"canonical":[49],"for":[52],"each":[53],"node":[54],"pair,":[55],"it":[56],"no":[58],"longer":[59],"guaranteed":[60],"that":[61],"build":[64],"paths":[66],"concatenating":[68],"selected":[70],"They":[73],"left":[74],"open":[77],"problem":[78],"whether":[79],"method":[81],"tiebreaking":[85],"with":[86],"this":[87],"desirable":[88],"property":[89],"generally":[91],"possible.":[92]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}