{"id":"https://openalex.org/W4399523474","doi":"https://doi.org/10.1145/3618260.3649729","title":"Connectivity Labeling and Routing with Multiple Vertex Failures","display_name":"Connectivity Labeling and Routing with Multiple Vertex Failures","publication_year":2024,"publication_date":"2024-06-10","ids":{"openalex":"https://openalex.org/W4399523474","doi":"https://doi.org/10.1145/3618260.3649729"},"language":"en","primary_location":{"id":"doi:10.1145/3618260.3649729","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649729","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649729","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649729","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","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"],"raw_orcid":"https://orcid.org/0000-0002-2357-2445","affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014977219","display_name":"Asaf Petruschka","orcid":"https://orcid.org/0009-0003-2325-2454"},"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":"Asaf Petruschka","raw_affiliation_strings":["Weizmann Institute of Science, Rehovot, Israel"],"raw_orcid":"https://orcid.org/0009-0003-2325-2454","affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076564426","display_name":"Seth Pettie","orcid":"https://orcid.org/0000-0002-0495-3904"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Seth Pettie","raw_affiliation_strings":["University of Michigan, Ann Arbor, USA"],"raw_orcid":"https://orcid.org/0000-0002-0495-3904","affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":2,"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":"823","last_page":"834"},"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.9997000098228455,"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.9997000098228455,"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/T10237","display_name":"Cryptography and Data Security","score":0.9972000122070312,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9970999956130981,"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/combinatorics","display_name":"Combinatorics","score":0.7209474444389343},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.712478756904602},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47045624256134033},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45827269554138184},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.435786634683609},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.42865657806396484},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42755287885665894}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7209474444389343},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.712478756904602},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47045624256134033},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45827269554138184},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.435786634683609},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.42865657806396484},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42755287885665894},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3618260.3649729","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649729","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649729","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3618260.3649729","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649729","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649729","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.46000000834465027}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4399523474.pdf"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W1487962539","https://openalex.org/W1559624579","https://openalex.org/W1963633992","https://openalex.org/W1996575062","https://openalex.org/W2017675289","https://openalex.org/W2019807548","https://openalex.org/W2024366499","https://openalex.org/W2043204450","https://openalex.org/W2066700938","https://openalex.org/W2071346873","https://openalex.org/W2153715991","https://openalex.org/W2343281498","https://openalex.org/W2488670996","https://openalex.org/W2766824301","https://openalex.org/W2949942995","https://openalex.org/W2972150782","https://openalex.org/W3112502550","https://openalex.org/W3115120381","https://openalex.org/W3116090397","https://openalex.org/W3131420626","https://openalex.org/W3183996897","https://openalex.org/W3212501503","https://openalex.org/W4230889046","https://openalex.org/W4238411931","https://openalex.org/W4293168155","https://openalex.org/W4298013539","https://openalex.org/W4313227189","https://openalex.org/W4399523474"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2980963558","https://openalex.org/W1882246857","https://openalex.org/W3103304230","https://openalex.org/W2185360082","https://openalex.org/W1992365905","https://openalex.org/W1976691234","https://openalex.org/W3212023493","https://openalex.org/W2090715877","https://openalex.org/W3111310291"],"abstract_inverted_index":{"We":[0],"present":[1,162,175],"succinct":[2,31,103],"labeling":[3,25,167],"schemes":[4,205,284],"for":[5,33,134,155],"answering":[6],"connectivity":[7,24,166],"queries":[8],"in":[9,73,152],"graphs":[10],"subject":[11],"to":[12,38,194,246],"a":[13,27,99,176,185,209,286],"specified":[14],"number":[15],"of":[16,41,52,57,105,241,258,269,289,300,318],"vertex":[17,126,248,293],"failures.":[18],"An":[19],"f-vertex/edge":[20],"fault":[21,249],"tolerant":[22],"(f-V/EFT)":[23],"is":[26,79,89,128,150,230],"scheme":[28,101,168,178,317],"that":[29,47,214,237,278],"produces":[30],"labels":[32,51,104,280],"the":[34,39,50,80,135,200,239,242,247,256,308,314],"vertices":[35,54],"(and":[36],"possibly":[37],"edges)":[40],"an":[42,163,195],"n-vertex":[43],"graph":[44,212,235],"G,":[45],"such":[46],"given":[48,287],"only":[49,301],"two":[53],"s,t":[55],"and":[56,69,94,142,184,218,222,244,262,271,297,320],"at":[58,290],"most":[59,291],"f":[60,156,292],"faulty":[61],"vertices/edges":[62],"F,":[63],"one":[64],"can":[65],"infer":[66],"if":[67],"s":[68],"t":[70],"are":[71,138,206,252],"connected":[72],"G\u2212F.":[74],"The":[75,86,131],"primary":[76],"complexity":[77],"measure":[78],"maximum":[81],"label":[82,202],"length":[83],"(in":[84],"bits).":[85],"f-EFT":[87],"setting":[88,137],"relatively":[90],"well":[91],"understood:":[92],"[Dory":[93],"Parter,":[95,272],"PODC":[96,117],"2021]":[97],"gave":[98,146],"randomized":[100,177],"with":[102,119,179,188,232,265,295],"O(log3":[106],"n)":[107],"bits,":[108],"which":[109,149,251],"was":[110],"subsequently":[111],"derandomized":[112,186,253],"by":[113,254,313],"[Izumi":[114],"et":[115,260],"al.,":[116],"2023]":[118],"\u00d5(f2)-bit":[120],"labels.":[121,228],"As":[122],"both":[123],"noted,":[124],"handling":[125],"faults":[127],"more":[129],"challenging.":[130],"known":[132],"bounds":[133,311],"f-VFT":[136,165],"far":[139],"away:":[140],"[Parter":[141],"Petruschka,":[143],"DISC":[144],"2022]":[145],"\u00d5(n1\u22121/2\u0398(f))-bit":[147],"labels,":[148,183,192],"linear":[151,234,309],"n":[153],"already":[154],"=\u03a9(loglogn).":[157],"In":[158],"this":[159],"work":[160],"we":[161,174,276],"efficient":[164],"using":[169],"poly(f,":[170],"logn)":[171],"bits.":[172,303],"Specifically,":[173],"O(f3":[180],"log5":[181],"n)-bit":[182,191],"version":[187],"O(f7":[189],"log13":[190],"compared":[193],"\u03a9(f)-bit":[196],"lower":[197],"bound":[198],"on":[199,208,216],"required":[201],"length.":[203],"Our":[204],"based":[207],"new":[210],"low-degree":[211],"decomposition":[213],"improves":[215,305],"[Duan":[217],"Pettie,":[219],"SODA":[220,273],"2017],":[221],"facilitates":[223],"its":[224],"distributed":[225],"representation":[226],"into":[227],"This":[229,304],"accompanied":[231],"specialized":[233],"sketches":[236],"extend":[238],"techniques":[240],"Dory":[243,319],"Parter":[245],"setting,":[250],"adapting":[255],"approach":[257],"Izumi":[259],"al.":[261],"combining":[263],"it":[264],"hit-miss":[266],"hash":[267],"families":[268],"[Karthik":[270],"2021].":[274],"Finally,":[275],"show":[277],"our":[279],"naturally":[281],"yield":[282],"routing":[283,316],"avoiding":[285],"set":[288],"failures":[294],"table":[296],"header":[298],"sizes":[299],"poly(f,logn)":[302],"significantly":[306],"over":[307],"size":[310],"implied":[312],"EFT":[315],"Parter.":[321]},"counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}