{"id":"https://openalex.org/W1491309030","doi":"https://doi.org/10.1007/3-540-45841-7_4","title":"A Space Lower Bound for Routing in Trees","display_name":"A Space Lower Bound for Routing in Trees","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1491309030","doi":"https://doi.org/10.1007/3-540-45841-7_4","mag":"1491309030"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45841-7_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45841-7_4","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/A5111427134","display_name":"Pierre Fraigniaud","orcid":null},"institutions":[{"id":"https://openalex.org/I102197404","display_name":"Universit\u00e9 Paris-Sud","ror":"https://ror.org/028rypz17","country_code":"FR","type":"education","lineage":["https://openalex.org/I102197404"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Pierre Fraigniaud","raw_affiliation_strings":["CNRS, Laboratoire de Recherche en Informatique, Universit\u00e9 Paris-Sud, 91405, Orsay cedex, France"],"affiliations":[{"raw_affiliation_string":"CNRS, Laboratoire de Recherche en Informatique, Universit\u00e9 Paris-Sud, 91405, Orsay cedex, France","institution_ids":["https://openalex.org/I4210144804","https://openalex.org/I102197404","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013587418","display_name":"Cyril Gavoille","orcid":"https://orcid.org/0000-0003-3671-8607"},"institutions":[{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Cyril Gavoille","raw_affiliation_strings":["Laboratoire Bordelais de Recherche en Informatique, Universit\u00e9 Bordeaux I, 33405, Talence cedex, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire Bordelais de Recherche en Informatique, Universit\u00e9 Bordeaux I, 33405, Talence cedex, France","institution_ids":["https://openalex.org/I4210142254"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111427134"],"corresponding_institution_ids":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I4210144804"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.9206,"has_fulltext":false,"cited_by_count":52,"citation_normalized_percentile":{"value":0.94206795,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"65","last_page":"75"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"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.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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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/routing-table","display_name":"Routing table","score":0.7426585555076599},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.5457496047019958},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5382835865020752},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5147245526313782},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5013530254364014},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.45262405276298523},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4502623677253723},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4345332384109497},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4250103831291199},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4237050712108612},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4197325110435486},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.41515493392944336},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.41198575496673584},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36017733812332153},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.29805582761764526},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.15229129791259766},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07923415303230286}],"concepts":[{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.7426585555076599},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.5457496047019958},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5382835865020752},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5147245526313782},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5013530254364014},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.45262405276298523},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4502623677253723},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4345332384109497},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4250103831291199},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4237050712108612},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4197325110435486},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.41515493392944336},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.41198575496673584},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36017733812332153},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.29805582761764526},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.15229129791259766},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07923415303230286},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-45841-7_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45841-7_4","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":19,"referenced_works":["https://openalex.org/W788200807","https://openalex.org/W1543879246","https://openalex.org/W1582742149","https://openalex.org/W1587867115","https://openalex.org/W2005580106","https://openalex.org/W2007575140","https://openalex.org/W2020085766","https://openalex.org/W2020965855","https://openalex.org/W2030306674","https://openalex.org/W2033112846","https://openalex.org/W2035494495","https://openalex.org/W2057994027","https://openalex.org/W2077824753","https://openalex.org/W2091569826","https://openalex.org/W2093455937","https://openalex.org/W2139539283","https://openalex.org/W2293001982","https://openalex.org/W2613345270","https://openalex.org/W4232548171"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W3127002380","https://openalex.org/W2117516174","https://openalex.org/W2041853321","https://openalex.org/W2406963874","https://openalex.org/W2751383119","https://openalex.org/W1984835167","https://openalex.org/W2361465121","https://openalex.org/W3195498289","https://openalex.org/W2607223747"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}