{"id":"https://openalex.org/W2103027585","doi":"https://doi.org/10.1007/978-3-642-40450-4_66","title":"Sparse Fault-Tolerant BFS Trees","display_name":"Sparse Fault-Tolerant BFS Trees","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2103027585","doi":"https://doi.org/10.1007/978-3-642-40450-4_66","mag":"2103027585"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-40450-4_66","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-40450-4_66","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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":["Department of Computer Science and Applied Mathematics, The Weizmann Institute, Rehovot, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Applied Mathematics, The Weizmann Institute, 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":["Department of Computer Science and Applied Mathematics, The Weizmann Institute, Rehovot, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Applied Mathematics, The Weizmann Institute, 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":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":4.5266,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.9491693,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"779","last_page":"790"},"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.9993000030517578,"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.9993000030517578,"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.9991000294685364,"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.998199999332428,"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.7206236720085144},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7164197564125061},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5117999911308289},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.49484962224960327},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"Breadth-first search","score":0.48513349890708923},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4544523060321808},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4474496841430664},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.44518983364105225},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43108218908309937},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4293452501296997},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.41383984684944153},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4017758369445801},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40094155073165894},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37260866165161133},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.21998992562294006},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.16909772157669067},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.15976649522781372},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09661409258842468},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0810239315032959}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7206236720085144},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7164197564125061},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5117999911308289},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.49484962224960327},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.48513349890708923},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4544523060321808},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4474496841430664},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.44518983364105225},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43108218908309937},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4293452501296997},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.41383984684944153},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4017758369445801},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40094155073165894},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37260866165161133},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.21998992562294006},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.16909772157669067},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.15976649522781372},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09661409258842468},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0810239315032959}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-40450-4_66","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-40450-4_66","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"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/W1947899203","https://openalex.org/W1965127928","https://openalex.org/W1969916852","https://openalex.org/W1989169588","https://openalex.org/W2017675289","https://openalex.org/W2018956470","https://openalex.org/W2018963243","https://openalex.org/W2031182187","https://openalex.org/W2045446569","https://openalex.org/W2050809450","https://openalex.org/W2057994027","https://openalex.org/W2073094163","https://openalex.org/W2075543862","https://openalex.org/W2091569826","https://openalex.org/W2117909275","https://openalex.org/W2118681568","https://openalex.org/W2134729426","https://openalex.org/W2135290460","https://openalex.org/W2142266972","https://openalex.org/W2143996311","https://openalex.org/W2146522997","https://openalex.org/W2157760787","https://openalex.org/W2199907825","https://openalex.org/W2206859651","https://openalex.org/W2611804663","https://openalex.org/W2766824301","https://openalex.org/W2949301464","https://openalex.org/W4205300528","https://openalex.org/W4244278461","https://openalex.org/W4245082111"],"related_works":["https://openalex.org/W2037710955","https://openalex.org/W620960161","https://openalex.org/W2045244794","https://openalex.org/W130518292","https://openalex.org/W4390962175","https://openalex.org/W1828145824","https://openalex.org/W2022598760","https://openalex.org/W2596986022","https://openalex.org/W1980641815","https://openalex.org/W2605620386"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}