{"id":"https://openalex.org/W1609380987","doi":"https://doi.org/10.1142/s0129054117500046","title":"Interval Routing Schemes for Circular-Arc Graphs","display_name":"Interval Routing Schemes for Circular-Arc Graphs","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W1609380987","doi":"https://doi.org/10.1142/s0129054117500046","mag":"1609380987"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054117500046","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054117500046","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1202.4160","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031299024","display_name":"Frank Gurski","orcid":"https://orcid.org/0000-0002-1212-1796"},"institutions":[{"id":"https://openalex.org/I44260953","display_name":"Heinrich Heine University D\u00fcsseldorf","ror":"https://ror.org/024z2rq82","country_code":"DE","type":"education","lineage":["https://openalex.org/I44260953"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Frank Gurski","raw_affiliation_strings":["Algorithmics for Hard Problems Group, Institute of Computer Science, Heinrich Heine University, D-40225 D\u00fcsseldorf, Germany"],"affiliations":[{"raw_affiliation_string":"Algorithmics for Hard Problems Group, Institute of Computer Science, Heinrich Heine University, D-40225 D\u00fcsseldorf, Germany","institution_ids":["https://openalex.org/I44260953"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024759446","display_name":"Patrick Poullie","orcid":null},"institutions":[{"id":"https://openalex.org/I202697423","display_name":"University of Zurich","ror":"https://ror.org/02crff812","country_code":"CH","type":"education","lineage":["https://openalex.org/I202697423"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Patrick Gwydion Poullie","raw_affiliation_strings":["Communication Systems Group, Department of Informatics, University of Zurich, CH-8050 Z\u00fcrich, Switzerland"],"affiliations":[{"raw_affiliation_string":"Communication Systems Group, Department of Informatics, University of Zurich, CH-8050 Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I202697423"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5031299024"],"corresponding_institution_ids":["https://openalex.org/I44260953"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00207234,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"28","issue":"01","first_page":"39","last_page":"60"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9975000023841858,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9972000122070312,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.6012593507766724},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.59086012840271},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5555649995803833},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5268415808677673},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4927261173725128},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.487578809261322},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.48558229207992554},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.443827360868454},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.4341243803501129},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42063120007514954},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.41292381286621094},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.38430047035217285},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36501339077949524},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.3480015695095062},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.26258087158203125},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2538326382637024},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09403640031814575},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.08572301268577576},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.06440502405166626}],"concepts":[{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.6012593507766724},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.59086012840271},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5555649995803833},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5268415808677673},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4927261173725128},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.487578809261322},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.48558229207992554},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.443827360868454},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.4341243803501129},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42063120007514954},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.41292381286621094},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.38430047035217285},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36501339077949524},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.3480015695095062},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.26258087158203125},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2538326382637024},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09403640031814575},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.08572301268577576},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.06440502405166626}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1142/s0129054117500046","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054117500046","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:www.zora.uzh.ch:136405","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401281","display_name":"Zurich Open Repository and Archive (University of Zurich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I202697423","host_organization_name":"University of Zurich","host_organization_lineage":["https://openalex.org/I202697423"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Gurski, Frank; Poullie, Patrick Gwydion  (2017). Interval routing schemes for circular-arc graphs.  International Journal of Foundations of Computer Science, 28(1):39-60.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1202.4160","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1202.4160","pdf_url":"https://arxiv.org/pdf/1202.4160","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"mag:1609380987","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1202.4160","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.751.2057","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.751.2057","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1202.4160.pdf","raw_type":"text"},{"id":"doi:10.48550/arxiv.1202.4160","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1202.4160","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"doi:10.5167/uzh-136405","is_oa":true,"landing_page_url":"https://doi.org/10.5167/uzh-136405","pdf_url":null,"source":{"id":"https://openalex.org/S7407051291","display_name":"Universit\u00e4t Z\u00fcrich, ZORA","issn_l":null,"issn":[],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1202.4160","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1202.4160","pdf_url":"https://arxiv.org/pdf/1202.4160","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W144954708","https://openalex.org/W1564902633","https://openalex.org/W1579049696","https://openalex.org/W1980392938","https://openalex.org/W1982667852","https://openalex.org/W1990277587","https://openalex.org/W2005349020","https://openalex.org/W2007610258","https://openalex.org/W2023365186","https://openalex.org/W2030306674","https://openalex.org/W2038033022","https://openalex.org/W2046662728","https://openalex.org/W2052186517","https://openalex.org/W2063048655","https://openalex.org/W2076497945","https://openalex.org/W2091569826","https://openalex.org/W2093095561","https://openalex.org/W2113613597","https://openalex.org/W2122120993","https://openalex.org/W2132816737","https://openalex.org/W2151358465","https://openalex.org/W2914484629"],"related_works":["https://openalex.org/W2963191535","https://openalex.org/W1541520143","https://openalex.org/W2016757044","https://openalex.org/W1487962539","https://openalex.org/W2885595814","https://openalex.org/W2116405248","https://openalex.org/W2115833060","https://openalex.org/W2950413606","https://openalex.org/W2122684646","https://openalex.org/W2783565018","https://openalex.org/W648382575","https://openalex.org/W1678825575","https://openalex.org/W2288492987","https://openalex.org/W2025595264","https://openalex.org/W3082210241","https://openalex.org/W1999867351","https://openalex.org/W2061208844","https://openalex.org/W1551723339","https://openalex.org/W2063916905","https://openalex.org/W3147002910"],"abstract_inverted_index":{"Interval":[0],"routing":[1,11,28,59,75,105,110,130],"is":[2,107,142],"a":[3,9,23,33,58,94,108],"space":[4],"efficient":[5],"method":[6],"to":[7,49,56,127],"realize":[8],"distributed":[10],"function.":[12],"In":[13],"this":[14,47],"paper":[15],"we":[16,99,123],"show":[17,100],"that":[18,61,82,101],"every":[19,53],"circular-arc":[20,67,86,133],"graph":[21],"allows":[22,55],"shortest":[24,64,72],"path":[25,73],"strict":[26,89],"2-interval":[27,104],"scheme,":[29],"i.e.,":[30],"by":[31],"introducing":[32],"global":[34],"order":[35,48],"on":[36],"the":[37,50,79,83,102,129,143],"vertices":[38],"and":[39,122],"assigning":[40],"at":[41,113,119],"most":[42,114],"two":[43],"(strict)":[44],"intervals":[45],"in":[46,77,135],"ends":[51],"of":[52,85,145],"edge":[54],"depict":[57],"function":[60],"implies":[62,81],"exclusively":[63],"paths.":[65],"Since":[66],"graphs":[68,87,134],"do":[69],"not":[70],"allow":[71],"1-interval":[74,109],"schemes":[76],"general,":[78],"result":[80],"class":[84],"has":[88],"compactness":[90],"2,":[91],"which":[92],"was":[93],"hitherto":[95],"open":[96],"question.":[97],"Additionally,":[98],"constructed":[103],"scheme":[106,111,131],"with":[112],"one":[115],"additional":[116],"interval":[117],"assigned":[118],"each":[120],"vertex":[121],"outline":[124],"an":[125],"algorithm":[126],"calculate":[128],"for":[132],"\ud835\udcaa(n":[136],"2":[137],")":[138],"time,":[139],"where":[140],"n":[141],"number":[144],"vertices.":[146]},"counts_by_year":[],"updated_date":"2026-04-02T15:55:50.835912","created_date":"2025-10-10T00:00:00"}