{"id":"https://openalex.org/W2096889089","doi":"https://doi.org/10.1145/1378533.1378542","title":"Polylogarithmic network navigability using compact metrics with small stretch","display_name":"Polylogarithmic network navigability using compact metrics with small stretch","publication_year":2008,"publication_date":"2008-06-14","ids":{"openalex":"https://openalex.org/W2096889089","doi":"https://doi.org/10.1145/1378533.1378542","mag":"2096889089"},"language":"en","primary_location":{"id":"doi:10.1145/1378533.1378542","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1378533.1378542","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},"type":"preprint","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/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/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"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I169173203","display_name":"D\u00e9l\u00e9gation Paris 7","ror":"https://ror.org/00bw5n526","country_code":"FR","type":"government","lineage":["https://openalex.org/I154526488","https://openalex.org/I169173203"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Pierre Fraigniaud","raw_affiliation_strings":["CNRS and University Paris Diderot, Paris, France","Laboratoire d'informatique Algorithmique : Fondements et Applications"],"affiliations":[{"raw_affiliation_string":"CNRS and University Paris Diderot, Paris, France","institution_ids":["https://openalex.org/I169173203","https://openalex.org/I204730241","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"Laboratoire d'informatique Algorithmique : Fondements et Applications","institution_ids":["https://openalex.org/I4210094115"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5107521624","display_name":"Cyril Gavoille","orcid":null},"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"]},{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Cyril Gavoille","raw_affiliation_strings":["University of Bordeaux, Bordeaux, France","Algorithmics for computationally intensive applications over wide scale distributed platforms","Laboratoire Bordelais de Recherche en Informatique"],"affiliations":[{"raw_affiliation_string":"University of Bordeaux, Bordeaux, France","institution_ids":["https://openalex.org/I15057530"]},{"raw_affiliation_string":"Algorithmics for computationally intensive applications over wide scale distributed platforms","institution_ids":[]},{"raw_affiliation_string":"Laboratoire Bordelais de Recherche en Informatique","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/I1294671590","https://openalex.org/I169173203","https://openalex.org/I204730241","https://openalex.org/I4210094115"],"apc_list":null,"apc_paid":null,"fwci":1.6438,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.84558848,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"62","last_page":"69"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9983000159263611,"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.9983000159263611,"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.9975000023841858,"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/T11478","display_name":"Caching and Content Delivery","score":0.9965999722480774,"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/navigability","display_name":"Navigability","score":0.8926562070846558},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7462571263313293},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6879885792732239},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5738682746887207},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.5363103151321411},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49714329838752747},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49287915229797363},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.4593406617641449},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4531151056289673},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.43886128067970276},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3937262296676636},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35298264026641846},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3243787884712219},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.32233723998069763},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2913827896118164},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.25411540269851685},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.14516183733940125},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10578712821006775}],"concepts":[{"id":"https://openalex.org/C2778972660","wikidata":"https://www.wikidata.org/wiki/Q1666353","display_name":"Navigability","level":2,"score":0.8926562070846558},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7462571263313293},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6879885792732239},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5738682746887207},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.5363103151321411},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49714329838752747},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49287915229797363},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.4593406617641449},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4531151056289673},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.43886128067970276},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3937262296676636},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35298264026641846},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3243787884712219},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32233723998069763},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2913827896118164},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.25411540269851685},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.14516183733940125},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10578712821006775},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/1378533.1378542","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1378533.1378542","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.394.1681","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.394.1681","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.liafa.jussieu.fr/~pierref/POSTSCRIPTS/SPAA2008.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.396.4601","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.396.4601","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dept-info.labri.fr/~gavoille/article/FG08/","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00367998v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00367998","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"20th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), Munich, Allemagne, juin 2008, Jun 2008, Munich, Germany. pp.62-69, ⟨10.1145/1378533.1378542⟩","raw_type":"Conference papers"},{"id":"pmh:oai:oskar-bordeaux.fr:20.500.12278/198484","is_oa":false,"landing_page_url":"https://oskar-bordeaux.fr/handle/20.500.12278/198484","pdf_url":null,"source":{"id":"https://openalex.org/S4306402569","display_name":"Oskar-Bordeaux (Universite de Bordeaux)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"20th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)","raw_type":"Communication dans un congr\u00e8s"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1485666733","https://openalex.org/W1486176979","https://openalex.org/W1502005853","https://openalex.org/W1502087588","https://openalex.org/W1573579329","https://openalex.org/W1599740739","https://openalex.org/W1986501893","https://openalex.org/W1992467531","https://openalex.org/W2005719338","https://openalex.org/W2016612548","https://openalex.org/W2026985208","https://openalex.org/W2034501275","https://openalex.org/W2045446569","https://openalex.org/W2053634345","https://openalex.org/W2056455770","https://openalex.org/W2083649025","https://openalex.org/W2098749004","https://openalex.org/W2101828567","https://openalex.org/W2107468791","https://openalex.org/W2128678576","https://openalex.org/W2135797138","https://openalex.org/W2137994750","https://openalex.org/W2141830959","https://openalex.org/W2150410057","https://openalex.org/W2154833764","https://openalex.org/W2158663853","https://openalex.org/W2160405192","https://openalex.org/W2243945130","https://openalex.org/W2293001982","https://openalex.org/W2293114900","https://openalex.org/W2589378794","https://openalex.org/W2683405002","https://openalex.org/W6634264458"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W4293054712","https://openalex.org/W2375775343","https://openalex.org/W2388654557","https://openalex.org/W2360981904","https://openalex.org/W2365712669","https://openalex.org/W2161960576","https://openalex.org/W2364500430","https://openalex.org/W3094029073"],"abstract_inverted_index":{"Graph":[0],"augmentation":[1,105],"theory":[2],"is":[3,14,47,94,103,139],"a":[4],"general":[5,141],"framework":[6],"for":[7,17,56,99],"analyzing":[8],"navigability":[9],"in":[10,39,117,140,167],"social":[11],"networks.":[12],"It":[13],"known":[15,49,84],"that,":[16],"large":[18],"classes":[19,53],"of":[20,25,43,54,78,91,121],"graphs,":[21],"there":[22,51,102],"exist":[23],"augmentations":[24,59],"these":[26],"graphs":[27,55],"such":[28,106],"that":[29,50,107],"greedy":[30,62,89,108,124,157],"routing":[31,63,109,125,158],"according":[32,64,110,126,159],"to":[33,65,70,111,127,143,150,160],"the":[34,66,82,88,112,128,146,152,161],"shortest":[35,67,113,129,147,162],"path":[36,68,114,130,148,163],"metric":[37,69,115,131,164],"performs":[38,116,165],"polylogarithmic":[40],"expected":[41,76,119],"number":[42,77,120],"steps.":[44,79,122],"However,":[45],"it":[46,138],"also":[48],"are":[52],"which":[57],"no":[58],"can":[60],"enable":[61],"perform":[71],"better":[72],"than":[73],"\u03a9(n1/\u221alog":[74],"n)":[75],"In":[80],"fact,":[81],"best":[83],"universal":[85],"bound":[86],"on":[87],"diameter":[90],"arbitrary":[92],"graph":[93],"essentially":[95],"n1/3.":[96],"That":[97],"is,":[98],"any":[100],"graph,":[101],"an":[104],"\u00d5(n1/3)":[118],"Hence,":[123],"has":[132],"at":[133],"least":[134],"two":[135],"drawbacks.":[136],"First,":[137],"space-consuming":[142],"encode":[144],"locally":[145],"distances":[149],"all":[151],"other":[153],"nodes,":[154],"and,":[155],"second,":[156],"poorly":[166],"some":[168],"graphs.":[169]},"counts_by_year":[{"year":2017,"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"}