{"id":"https://openalex.org/W1564902633","doi":"https://doi.org/10.1007/bfb0056481","title":"The compactness of interval routing for almost all graphs","display_name":"The compactness of interval routing for almost all graphs","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W1564902633","doi":"https://doi.org/10.1007/bfb0056481","mag":"1564902633"},"language":"en","primary_location":{"id":"doi:10.1007/bfb0056481","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0056481","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/A5013587418","display_name":"Cyril Gavoille","orcid":"https://orcid.org/0000-0003-3671-8607"},"institutions":[{"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"]},{"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/I4210160189","display_name":"Institut Polytechnique de Bordeaux","ror":"https://ror.org/054qv7y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Cyril Gavoille","raw_affiliation_strings":["LaBRI, Universit\u00e9 Bordeaux I, 351, cours de la Lib\u00e9ration, 33405, Talence Cedex, France","UNIVERSITE BORDEAUX I"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LaBRI, Universit\u00e9 Bordeaux I, 351, cours de la Lib\u00e9ration, 33405, Talence Cedex, France","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210160189"]},{"raw_affiliation_string":"UNIVERSITE BORDEAUX I","institution_ids":["https://openalex.org/I15057530"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056419022","display_name":"David Peleg","orcid":"https://orcid.org/0000-0003-1590-0506"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"David Peleg","raw_affiliation_strings":["Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, 76100, Rehovot, Israel","The Weizmann Inst. of Sci"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, 76100, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]},{"raw_affiliation_string":"The Weizmann Inst. of Sci","institution_ids":["https://openalex.org/I53964585"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.0112,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.7425668,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"161","last_page":"174"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.6955452561378479},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.6207643747329712},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5299269556999207},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5233259201049805},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5059849619865417},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4888285994529724},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4625939726829529},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4619671702384949},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.45713815093040466},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43997010588645935},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4257047772407532},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2695595324039459},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.18323439359664917},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.11901217699050903},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.04860711097717285}],"concepts":[{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.6955452561378479},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.6207643747329712},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5299269556999207},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5233259201049805},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5059849619865417},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4888285994529724},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4625939726829529},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4619671702384949},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.45713815093040466},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43997010588645935},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4257047772407532},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2695595324039459},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.18323439359664917},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.11901217699050903},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.04860711097717285},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/bfb0056481","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0056481","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.29.1414","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.1414","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/GP01.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.32.7353","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.7353","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.u-bordeaux.fr/~gavoille/article/GP98a_up.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.41.6738","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.6738","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-sor.inria.fr/mirrors/disc98/postscripts/14990163.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.457.377","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.457.377","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/GP01/","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.50.4367","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.4367","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.u-bordeaux.fr/pub/Local/Info/Publications/Rapports-internes/RR-120298.ps.Z","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1510565022","https://openalex.org/W1982100216","https://openalex.org/W2018598057","https://openalex.org/W2035260516","https://openalex.org/W2068871408","https://openalex.org/W2075738659","https://openalex.org/W2146257986","https://openalex.org/W2151358465","https://openalex.org/W2169999610","https://openalex.org/W2905110430","https://openalex.org/W2914484629"],"related_works":["https://openalex.org/W2349715051","https://openalex.org/W2555559350","https://openalex.org/W2113362813","https://openalex.org/W2386369498","https://openalex.org/W2108305519","https://openalex.org/W2351097701","https://openalex.org/W1996079847","https://openalex.org/W2154440508","https://openalex.org/W2114321370","https://openalex.org/W1924167960"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}