{"id":"https://openalex.org/W1976064016","doi":"https://doi.org/10.1145/1148109.1148147","title":"Compact routing with additive stretch using distance labelings","display_name":"Compact routing with additive stretch using distance labelings","publication_year":2006,"publication_date":"2006-07-30","ids":{"openalex":"https://openalex.org/W1976064016","doi":"https://doi.org/10.1145/1148109.1148147","mag":"1976064016"},"language":"en","primary_location":{"id":"doi:10.1145/1148109.1148147","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1148109.1148147","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},"type":"conference-paper","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/A5053686363","display_name":"Arthur Brady","orcid":"https://orcid.org/0000-0002-8809-2477"},"institutions":[{"id":"https://openalex.org/I121934306","display_name":"Tufts University","ror":"https://ror.org/05wvpxv85","country_code":"US","type":"education","lineage":["https://openalex.org/I121934306"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Arthur Brady","raw_affiliation_strings":["Tufts University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tufts University","institution_ids":["https://openalex.org/I121934306"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026411021","display_name":"Lenore Cowen","orcid":"https://orcid.org/0000-0001-6698-6413"},"institutions":[{"id":"https://openalex.org/I121934306","display_name":"Tufts University","ror":"https://ror.org/05wvpxv85","country_code":"US","type":"education","lineage":["https://openalex.org/I121934306"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lenore Cowen","raw_affiliation_strings":["Tufts University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tufts University","institution_ids":["https://openalex.org/I121934306"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I121934306"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11000164,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"233","last_page":"233"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9925000071525574,"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.9925000071525574,"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.9889000058174133,"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.9803000092506409,"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/combinatorics","display_name":"Combinatorics","score":0.6515642404556274},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5773287415504456},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5483523011207581},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5442379713058472},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5018608570098877},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.43943747878074646},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3612478971481323},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35176846385002136},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2920781970024109},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1733277142047882},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07906988263130188}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6515642404556274},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5773287415504456},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5483523011207581},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5442379713058472},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5018608570098877},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.43943747878074646},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3612478971481323},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35176846385002136},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2920781970024109},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1733277142047882},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07906988263130188}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1148109.1148147","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1148109.1148147","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2034501275","https://openalex.org/W2035494495","https://openalex.org/W2057994027"],"related_works":["https://openalex.org/W1511821218","https://openalex.org/W2175868772","https://openalex.org/W1587078595","https://openalex.org/W2124176527","https://openalex.org/W2985636744","https://openalex.org/W2125058377","https://openalex.org/W4306887989","https://openalex.org/W1987968444","https://openalex.org/W2181309150","https://openalex.org/W1166132007"],"abstract_inverted_index":{"Distance":[0],"labelings":[1,38,95,118],"--":[2,16],"introduced":[3],"as":[4,80,191],"a":[5,13,146,225],"new":[6],"way":[7],"to":[8,56,114,129,199,243,253],"encode":[9],"graph":[10,134],"topology":[11],"in":[12,36,59],"distributed":[14],"fashion":[15],"have":[17,66,122],"been":[18,67],"an":[19,43,137,163,237],"active":[20],"area":[21],"of":[22,48,88,111,166,180,209,217,240,250,256],"research":[23],"(see":[24],"[1,":[25],"2]":[26],"for":[27,46,178,206],"details).":[28],"In":[29,222],"both":[30,92,223],"exact":[31,93,116,138],"and":[32,39,51,86,96,162,212,233,236],"approximate":[33],"settings,":[34],"results":[35,65],"distance":[37,94,117,139],"compact":[40,104,147,175,185,226],"routing":[41,49,105,148,160,176,186,227,234],"(for":[42],"introduction,":[44],"esp.":[45],"definitions":[47],"tables":[50],"headers,":[52,155],"see":[53],"[3])":[54],"seem":[55],"go":[57],"hand":[58],"hand,":[60],"but":[61,107],"so":[62],"far":[63],"these":[64,251],"produced":[68],"separately.":[69],"It":[70],"was":[71,188],"already":[72],"known":[73,113,174],"that":[74,131,195],"graphs":[75,85,87,112,181,211,215],"with":[76,141,150,230],"constantsized":[77],"separators":[78],"such":[79,190],"trees,":[81],"outerplanar":[82],"graphs,":[83],"seriesparallel":[84],"bounded":[89],"treewidth,":[90],"support":[91],"optimal":[97],"(additive":[98],"stretch":[99,102,165,239],"0,":[100],"multiplicative":[101],"1)":[103],"schemes,":[106],"there":[108],"are":[109],"classes":[110,179,208],"admit":[115],"which":[119,135,218],"do":[120],"not":[121],"constant-sized":[123,220],"separators.":[124],"Our":[125,168],"main":[126],"result":[127,170,205],"is":[128,197],"demonstrate":[130],"every":[132],"n-vertex":[133],"supports":[136,145],"labeling":[140],"O(l(n))-sized":[142],"labels":[143],"also":[144],"scheme":[149,187,228],"O(l(n)":[151],"+":[152,157],"log2":[153,158],"n)-sized":[154],"O(\u221an(l(n)":[156],"n))-sized":[159],"tables,":[161,235],"additive":[164,238],"6.":[167],"general":[169,204],"produces":[171],"the":[172,207],"first":[173],"schemes":[177],"where":[182],"no":[183],"previous":[184],"known,":[189],"permutation":[192],"graphs.We":[193],"note":[194],"it":[196],"possible":[198],"improve":[200],"substantially":[201],"on":[202],"our":[203],"interval":[210],"circular":[213],"arc":[214],"(neither":[216],"admits":[219],"separators).":[221],"cases,":[224],"exists":[229],"polylogarithmic":[231],"headers":[232],"1;":[241],"due":[242],"space":[244],"constraints,":[245],"we":[246],"defer":[247],"further":[248],"discussion":[249],"cases":[252],"future":[254],"presentations":[255],"this":[257],"work.":[258]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}