{"id":"https://openalex.org/W2092319564","doi":"https://doi.org/10.1137/s0097539799351717","title":"The Compactness of Interval Routing for Almost All Graphs","display_name":"The Compactness of Interval Routing for Almost All Graphs","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2092319564","doi":"https://doi.org/10.1137/s0097539799351717","mag":"2092319564"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539799351717","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539799351717","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","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/A5013587418","display_name":"Cyril Gavoille","orcid":"https://orcid.org/0000-0003-3671-8607"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cyril Gavoille","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5056419022","display_name":"David Peleg","orcid":"https://orcid.org/0000-0003-1590-0506"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Peleg","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3638,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.81832426,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"31","issue":"3","first_page":"706","last_page":"721"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9994999766349792,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9994999766349792,"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/T11567","display_name":"semigroups and automata theory","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/T12029","display_name":"DNA and Biological Computing","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/compact-space","display_name":"Compact space","score":0.6578463315963745},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5802294015884399},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5515093207359314},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.5480624437332153},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5414329767227173},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49549710750579834},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42494627833366394},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.40251022577285767},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36572787165641785},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.19895288348197937},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.17897537350654602},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10950100421905518},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.09339305758476257}],"concepts":[{"id":"https://openalex.org/C18648836","wikidata":"https://www.wikidata.org/wiki/Q381892","display_name":"Compact space","level":2,"score":0.6578463315963745},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5802294015884399},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5515093207359314},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.5480624437332153},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5414329767227173},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49549710750579834},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42494627833366394},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.40251022577285767},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36572787165641785},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.19895288348197937},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.17897537350654602},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10950100421905518},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.09339305758476257}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539799351717","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539799351717","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","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":6,"referenced_works":["https://openalex.org/W2030306674","https://openalex.org/W2035260516","https://openalex.org/W2075738659","https://openalex.org/W2151358465","https://openalex.org/W2169999610","https://openalex.org/W2914484629"],"related_works":["https://openalex.org/W2006955534","https://openalex.org/W2153789027","https://openalex.org/W1987143101","https://openalex.org/W1994156213","https://openalex.org/W2251679127","https://openalex.org/W2272336114","https://openalex.org/W2124526408","https://openalex.org/W2407722793","https://openalex.org/W2020877234","https://openalex.org/W119875857"],"abstract_inverted_index":{"Interval":[0],"routing":[1,8,32,70,98,149,179,189],"is":[2,14],"a":[3,11,54,66,145,151,176],"compact":[4],"way":[5],"of":[6,36,43,56,60,81,96,188],"representing":[7],"tables":[9],"on":[10,16,194],"graph.":[12],"It":[13,169],"based":[15],"grouping":[17],"together,":[18],"in":[19,30,87,142,166],"each":[20,167],"node,":[21,192],"destination":[22],"addresses":[23,37,80,103,131],"that":[24,48,109,118,171],"use":[25],"the":[26,31,51,62,79,82,94,97,102,129,195],"same":[27],"outgoing":[28,75,113,155,164],"edge":[29,114,156],"table.":[33],"Such":[34],"groups":[35],"are":[38,84,104,121],"represented":[39],"by":[40,93],"some":[41],"intervals":[42,73,111,120],"consecutive":[44],"integers.":[45],"We":[46],"show":[47,108,138],"almost":[49,124,172],"all":[50,61,125,158,173],"graphs,":[52,64],"i.e.,":[53],"fraction":[55],"at":[57,160,183],"least":[58],"1-1/n2":[59],"n-node":[63],"support":[65,175],"shortest":[67,146,177],"path":[68,147,178],"interval":[69,148,153],"with":[71,150],"three":[72],"per":[74,112,154,191],"edge,":[76],"even":[77],"if":[78,128],"nodes":[83],"arbitrarily":[85],"fixed":[86],"advance":[88],"and":[89],"cannot":[90],"be":[91,133],"chosen":[92,134],"designer":[95],"scheme.":[99],"In":[100],"case":[101],"initialized":[105],"randomly,":[106],"we":[107,137],"two":[110,119],"suffice,":[115],"and,":[116],"conversely,":[117],"required":[122],"for":[123,157],"graphs.":[126],"Finally,":[127],"node":[130],"can":[132],"as":[135],"desired,":[136],"how":[139],"to":[140],"design":[141],"polynomial":[143],"time":[144],"single":[152],"but":[159],"most":[161,184],"O(log3n":[162],")":[163,186],"edges":[165],"node.":[168],"follows":[170],"graphs":[174],"scheme":[180],"which":[181],"requires":[182],"n+O(log4n":[185],"bits":[187],"information":[190],"improving":[193],"previous":[196],"upper":[197],"bound.":[198]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}