{"id":"https://openalex.org/W2530362908","doi":"https://doi.org/10.1145/2976741","title":"Sparse Fault-Tolerant BFS Structures","display_name":"Sparse Fault-Tolerant BFS Structures","publication_year":2016,"publication_date":"2016-10-10","ids":{"openalex":"https://openalex.org/W2530362908","doi":"https://doi.org/10.1145/2976741","mag":"2530362908"},"language":"en","primary_location":{"id":"doi:10.1145/2976741","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2976741","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/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":true,"raw_author_name":"Merav Parter","raw_affiliation_strings":["The Weizmann Institute of Science, Rehovot, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"last","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":["The Weizmann Institute of Science, Rehovot, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022875077"],"corresponding_institution_ids":["https://openalex.org/I53964585"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.11709409,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"13","issue":"1","first_page":"1","last_page":"24"},"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.9991000294685364,"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.9991000294685364,"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.9990000128746033,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9987000226974487,"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/vertex","display_name":"Vertex (graph theory)","score":0.7199517488479614},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6836010217666626},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"Breadth-first search","score":0.5091313719749451},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49720242619514465},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.483782023191452},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.46295031905174255},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.45839226245880127},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4324844479560852},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4266374409198761},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.42558354139328003},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.42178183794021606},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.41679874062538147},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.41614770889282227},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4001219868659973},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39845171570777893},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.370297908782959},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.20700564980506897},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11351171135902405},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.08305463194847107},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07792147994041443},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07637682557106018}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7199517488479614},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6836010217666626},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.5091313719749451},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49720242619514465},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.483782023191452},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.46295031905174255},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.45839226245880127},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4324844479560852},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4266374409198761},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.42558354139328003},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.42178183794021606},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.41679874062538147},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.41614770889282227},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4001219868659973},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39845171570777893},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.370297908782959},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.20700564980506897},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11351171135902405},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.08305463194847107},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07792147994041443},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07637682557106018},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2976741","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2976741","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1951571796","display_name":null,"funder_award_id":"2008348","funder_id":"https://openalex.org/F4320320950","funder_display_name":"United States-Israel Binational Science Foundation"},{"id":"https://openalex.org/G4434221616","display_name":null,"funder_award_id":"894/09","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320309327","display_name":"Google","ror":"https://ror.org/00njsd438"},{"id":"https://openalex.org/F4320320950","display_name":"United States-Israel Binational Science Foundation","ror":"https://ror.org/00j8z2m73"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320332412","display_name":"Citi Foundation","ror":"https://ror.org/032xgdx47"},{"id":"https://openalex.org/F4320335016","display_name":"Israeli Centers for Research Excellence","ror":"https://ror.org/03w2v9593"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1487962539","https://openalex.org/W1497822004","https://openalex.org/W1564010364","https://openalex.org/W1568961751","https://openalex.org/W1577501260","https://openalex.org/W1859011291","https://openalex.org/W1965127928","https://openalex.org/W1969916852","https://openalex.org/W1989169588","https://openalex.org/W2017675289","https://openalex.org/W2018963243","https://openalex.org/W2022973561","https://openalex.org/W2031182187","https://openalex.org/W2034680223","https://openalex.org/W2045446569","https://openalex.org/W2050809450","https://openalex.org/W2057994027","https://openalex.org/W2073094163","https://openalex.org/W2091569826","https://openalex.org/W2117909275","https://openalex.org/W2134729426","https://openalex.org/W2142266972","https://openalex.org/W2143996311","https://openalex.org/W2146522997","https://openalex.org/W2199907825","https://openalex.org/W2206859651","https://openalex.org/W2579637306","https://openalex.org/W2611804663","https://openalex.org/W2766824301","https://openalex.org/W3138427988","https://openalex.org/W4205300528","https://openalex.org/W4245082111","https://openalex.org/W4300550233"],"related_works":["https://openalex.org/W2037710955","https://openalex.org/W2985498454","https://openalex.org/W3098335909","https://openalex.org/W2008046591","https://openalex.org/W2088116875","https://openalex.org/W2120739134","https://openalex.org/W2255943860","https://openalex.org/W2605620386","https://openalex.org/W2349743712","https://openalex.org/W1967528652"],"abstract_inverted_index":{"A":[0],"fault-tolerant":[1,38,261],"structure":[2,40,131,190,248,324,367],"for":[3,8,78,145,174,241,283,305,387,411,442],"a":[4,36,44,60,74,86,91,124,185,225,237,271,273,301,320,398,435],"network":[5,51],"is":[6,121,209,222,395,425],"required":[7],"continued":[9],"functioning":[10],"following":[11],"the":[12,17,32,49,57,65,103,133,210,213,346,430,460],"failure":[13,58,456],"of":[14,16,34,48,59,70,135,212,286,316,360,432,437],"some":[15,284,443],"network\u2019s":[18],"edges":[19,433],"or":[20,63],"vertices.":[21],"This":[22,220],"article":[23],"considers":[24],"breadth-first":[25],"search":[26],"(BFS)":[27],"spanning":[28,76],"trees":[29],"and":[30,96,153,180,310,390,427],"addresses":[31],"problem":[33],"designing":[35],"sparse":[37,45],"BFS":[39,75,214,263,274],"(FT-BFS":[41],"structure),":[42],"namely,":[43],"subgraph":[46],"T":[47,68,71,325],"given":[50],"G":[52,83,101,151,161,179],"such":[53],"that":[54,115,173,230,298,304,402],"subsequent":[55],"to":[56,268,439,451],"single":[61],"edge":[62,98,156,187,244],"vertex,":[64],"surviving":[66,80],"part":[67,81],"\u2032":[69],"still":[72],"contains":[73,132],"tree":[77,215,275],"(the":[79],"of)":[82],".":[84,127,219,291],"For":[85],"source":[87,181,238,279,311,331,355],"node":[88,93,182,239],"s":[89,105,110,140,183,193,201,207,218,240,251,280,332],",":[90,95,102,111,113,141,143,336],"target":[92],"t":[94,107,112,142,147],"an":[97,171,380],"e":[99,114,120,144,157],"\u2208":[100,148,158,281,334],"shortest":[104],"\u2212":[106],"path":[108,126],"P":[109,139],"does":[116],"not":[117],"go":[118],"through":[119],"known":[122],"as":[123,167,457],"replacement":[125,137],"Thus,":[128],"our":[129,423,446],"FT-BFS":[130,189,247,389],"collection":[134],"all":[136],"paths":[138],"every":[146,154,175,306],"V":[149,290,315,359],"(":[150,160,196],")":[152,208,256,328,375,384,408],"failed":[155],"E":[159],").":[162],"Our":[163],"main":[164],"results":[165],"are":[166,295],"follows.":[168],"We":[169,258],"present":[170],"algorithm":[172,303,386,410,424],"n":[176,197,233,254,307,341,351,373,383,407,441],"-vertex":[177,234,308,352],"graph":[178,309],"constructs":[184,319],"(single":[186,321],"failure)":[188,272,322],"rooted":[191,216,249,276],"at":[192,217,250,277],"with":[194,236,337,354,420,453,459],"O":[195,338,381],"\u010b":[198,340,372],"min":[199],"{Depth(":[200],"),":[202],"\u221an{)":[203],"edges,":[204,343],"where":[205],"Depth(":[206],"depth":[211],"result":[221,400],"complemented":[223,396],"by":[224,397,434],"matching":[226],"lower":[227],"bound,":[228],"showing":[229,297],"there":[231,299,349,403],"exist":[232,350],"graphs":[235,353],"which":[242,364],"any":[243,365],"(or":[245],"vertex)":[246],"has":[252,370],"\u03a9(":[253],"3/2":[255,374],"edges.":[257,376],"then":[259],"consider":[260],"multi-source":[262],"structures":[264],"(FT-MBFS":[265],"structures),":[266],"aiming":[267],"provide":[269],"(following":[270],"each":[278,330],"S":[282,288,313,327,335,357,369],"subset":[285],"sources":[287],"\u2286":[289,314,358],"Again,":[292],"tight":[293],"bounds":[294],"provided,":[296],"exists":[300,404],"poly-time":[302],"set":[312],"size":[317],"\u03c3":[318],"FT-MBFS":[323,366,391],"*(":[326],"from":[329,368],"i":[333],"(\u221a\u03c3":[339],"&lt;sup;&gt;3/2&lt;/sup;&gt;)":[342],"and,":[344],"on":[345,363],"other":[347],"hand,":[348],"sets":[356],"cardinality":[361],"\u03c3,":[362],"\u03a9(\u221a\u03c3":[371],"Finally,":[377],"we":[378],"propose":[379],"(log":[382],"approximation":[385,409],"constructing":[388],"structures.":[392],"The":[393],"latter":[394],"hardness":[399],"stating":[401],"no":[405],"\u03a9(log":[406],"these":[412],"problems":[413],"under":[414],"standard":[415],"complexity":[416],"assumptions.":[417],"In":[418],"comparison":[419],"previous":[421],"constructions,":[422],"deterministic":[426],"may":[428],"improve":[429],"number":[431],"factor":[436],"up":[438],"\u221a":[440],"instances.":[444],"All":[445],"algorithms":[447],"can":[448],"be":[449],"extended":[450],"deal":[452],"one":[454],"vertex":[455],"well,":[458],"same":[461],"performance.":[462]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2015,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}
