{"id":"https://openalex.org/W1992732243","doi":"https://doi.org/10.1137/06067626x","title":"A Lower Bound for Network Navigability","display_name":"A Lower Bound for Network Navigability","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1992732243","doi":"https://doi.org/10.1137/06067626x","mag":"1992732243"},"language":"en","primary_location":{"id":"doi:10.1137/06067626x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/06067626x","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","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/A5110465085","display_name":"Pierre Fraigniaud","orcid":null},"institutions":[{"id":"https://openalex.org/I4210094115","display_name":"Laboratoire d'Informatique Algorithmique: Fondements et Applications","ror":"https://ror.org/00pbqgm18","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I204730241","https://openalex.org/I4210094115","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Pierre Fraigniaud","raw_affiliation_strings":["Pierre.Fraigniaud@liafa.jussieu.fr and Emmanuelle.Lebhar@liafa.jussieu.fr#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Pierre.Fraigniaud@liafa.jussieu.fr and Emmanuelle.Lebhar@liafa.jussieu.fr#TAB#","institution_ids":["https://openalex.org/I4210094115"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054435097","display_name":"Emmanuelle Lebhar","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Emmanuelle Lebhar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5016606156","display_name":"Zvi Lotker","orcid":"https://orcid.org/0000-0002-3759-5584"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zvi Lotker","raw_affiliation_strings":["zvilo@cse.bgo.ac.il#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"zvilo@cse.bgo.ac.il#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6914,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.83351036,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"24","issue":"1","first_page":"72","last_page":"81"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987999796867371,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9987999796867371,"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.9944000244140625,"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/T11342","display_name":"Carbon and Quantum Dots Applications","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/navigability","display_name":"Navigability","score":0.9804314374923706},{"id":"https://openalex.org/keywords/polygon-mesh","display_name":"Polygon mesh","score":0.7456536293029785},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.7321323752403259},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.675862193107605},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6547949314117432},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5252974629402161},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.46557754278182983},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46068763732910156},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.45270228385925293},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.27551084756851196},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1468033492565155},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10893774032592773}],"concepts":[{"id":"https://openalex.org/C2778972660","wikidata":"https://www.wikidata.org/wiki/Q1666353","display_name":"Navigability","level":2,"score":0.9804314374923706},{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.7456536293029785},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.7321323752403259},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.675862193107605},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6547949314117432},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5252974629402161},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.46557754278182983},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46068763732910156},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.45270228385925293},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27551084756851196},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1468033492565155},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10893774032592773},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/06067626x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/06067626x","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1502005853","https://openalex.org/W1572272766","https://openalex.org/W1573579329","https://openalex.org/W1976509511","https://openalex.org/W1986501893","https://openalex.org/W2053634345","https://openalex.org/W2056455770","https://openalex.org/W2102465486","https://openalex.org/W2128678576","https://openalex.org/W2142253242","https://openalex.org/W2150410057","https://openalex.org/W2154833764","https://openalex.org/W2243945130"],"related_works":["https://openalex.org/W5921410","https://openalex.org/W2161466705","https://openalex.org/W2026584759","https://openalex.org/W2187647911","https://openalex.org/W2532352661","https://openalex.org/W4205716406","https://openalex.org/W2779649857","https://openalex.org/W4213236950","https://openalex.org/W1907304534","https://openalex.org/W2964295174"],"abstract_inverted_index":{"In":[0,49],"his":[1],"seminal":[2],"work,":[3],"Kleinberg":[4],"showed":[5],"how":[6],"to":[7,68,109,133,137],"augment":[8],"meshes":[9,126],"using":[10],"random":[11,75],"edges,":[12],"so":[13],"that":[14,18,64,82,95,130,149],"they":[15],"become":[16,69,110,138],"navigable;":[17],"is,":[19],"greedy":[20],"routing":[21],"computes":[22],"paths":[23],"of":[24,31,38,62,74,84,104,124,127],"polylogarithmic":[25],"expected":[26],"length":[27],"between":[28],"any":[29],"pairs":[30],"nodes.":[32],"This":[33,140],"yields":[34],"the":[35,72,121,156],"crucial":[36],"question":[37,55],"determining":[39],"whether":[40],"such":[41],"an":[42,59,101],"augmentation":[43],"is":[44],"possible":[45],"for":[46,96],"all":[47],"graphs.":[48],"this":[50,54],"paper,":[51],"we":[52,113,131],"answer":[53],"negatively":[56],"by":[57,119],"exhibiting":[58],"infinite":[60,102],"family":[61,103],"graphs":[63,83,105],"cannot":[65,106],"be":[66,107,135],"augmented":[67,108],"navigable":[70],"whatever":[71],"distribution":[73],"edges":[76],"is.":[77],"Precisely,":[78],"it":[79],"was":[80],"known":[81],"doubling":[85,97],"dimension":[86,98,129],"at":[87],"most":[88],"$O(\\log\\log":[89],"n)$":[90],"are":[91],"navigable.":[92,111,139],"We":[93],"show":[94],"$\\gg\\log\\log":[99],"n$,":[100],"Finally,":[112],"present":[114],"a":[115],"positive":[116],"navigability":[117],"result":[118,142,146],"studying":[120],"special":[122],"case":[123],"square":[125],"arbitrary":[128],"prove":[132],"always":[134],"augmentable":[136],"latter":[141],"complements":[143],"Kleinberg's":[144],"original":[145],"and":[147],"shows":[148],"adding":[150],"extra":[151],"links":[152],"can":[153],"sometimes":[154],"break":[155],"navigability.":[157]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}