{"id":"https://openalex.org/W2029678703","doi":"https://doi.org/10.1007/pl00009251","title":"Compact Routing on Chordal Rings of Degree 4","display_name":"Compact Routing on Chordal Rings of Degree 4","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2029678703","doi":"https://doi.org/10.1007/pl00009251","mag":"2029678703"},"language":"en","primary_location":{"id":"doi:10.1007/pl00009251","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00009251","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5067542317","display_name":"Lata Narayanan","orcid":"https://orcid.org/0000-0002-3875-0371"},"institutions":[{"id":"https://openalex.org/I60158472","display_name":"Concordia University","ror":"https://ror.org/0420zvk78","country_code":"CA","type":"education","lineage":["https://openalex.org/I60158472"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"L. Narayanan","raw_affiliation_strings":["Department of Computer Science, Concordia University,  Montreal, Quebec, Canada H3G 1M8.  lata@cs.concordia.ca, opatrny@cs.concordia.ca., , , , , , CA","Department of Computer Science, Concordia University,  Montreal, Quebec, Canada H3G 1M8.  lata@cs.concordia.ca, opatrny@cs.concordia.ca., , CA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Concordia University,  Montreal, Quebec, Canada H3G 1M8.  lata@cs.concordia.ca, opatrny@cs.concordia.ca., , , , , , CA","institution_ids":["https://openalex.org/I60158472"]},{"raw_affiliation_string":"Department of Computer Science, Concordia University,  Montreal, Quebec, Canada H3G 1M8.  lata@cs.concordia.ca, opatrny@cs.concordia.ca., , CA","institution_ids":["https://openalex.org/I60158472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054078495","display_name":"Josef Opatrn\u00fd","orcid":"https://orcid.org/0000-0002-2427-5434"},"institutions":[{"id":"https://openalex.org/I60158472","display_name":"Concordia University","ror":"https://ror.org/0420zvk78","country_code":"CA","type":"education","lineage":["https://openalex.org/I60158472"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"J. Opatrny","raw_affiliation_strings":["Department of Computer Science, Concordia University,  Montreal, Quebec, Canada H3G 1M8.  lata@cs.concordia.ca, opatrny@cs.concordia.ca., , , , , , CA","Department of Computer Science, Concordia University,  Montreal, Quebec, Canada H3G 1M8.  lata@cs.concordia.ca, opatrny@cs.concordia.ca., , CA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Concordia University,  Montreal, Quebec, Canada H3G 1M8.  lata@cs.concordia.ca, opatrny@cs.concordia.ca., , , , , , CA","institution_ids":["https://openalex.org/I60158472"]},{"raw_affiliation_string":"Department of Computer Science, Concordia University,  Montreal, Quebec, Canada H3G 1M8.  lata@cs.concordia.ca, opatrny@cs.concordia.ca., , CA","institution_ids":["https://openalex.org/I60158472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5067542317"],"corresponding_institution_ids":["https://openalex.org/I60158472"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.4048,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.72363981,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"23","issue":"1","first_page":"72","last_page":"96"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9962999820709229,"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/chordal-graph","display_name":"Chordal graph","score":0.7236311435699463},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6544251441955566},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6424462795257568},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.6065612435340881},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.565388023853302},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49090057611465454},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.42238736152648926},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.4168066382408142},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.4123656153678894},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4117873013019562},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.406020849943161},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.37353813648223877},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2683600187301636},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.26698464155197144},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.13733968138694763},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.11802762746810913}],"concepts":[{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.7236311435699463},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6544251441955566},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6424462795257568},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.6065612435340881},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.565388023853302},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49090057611465454},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.42238736152648926},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.4168066382408142},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.4123656153678894},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4117873013019562},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.406020849943161},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.37353813648223877},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2683600187301636},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.26698464155197144},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13733968138694763},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.11802762746810913},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/pl00009251","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00009251","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1534783156","https://openalex.org/W1541520143","https://openalex.org/W1695740880","https://openalex.org/W2006383304","https://openalex.org/W2012361582","https://openalex.org/W2038033022","https://openalex.org/W2049706063","https://openalex.org/W2053081939","https://openalex.org/W2063048655","https://openalex.org/W2069587263","https://openalex.org/W2077736855","https://openalex.org/W2094613978","https://openalex.org/W2130026731","https://openalex.org/W2151358465","https://openalex.org/W2179003801","https://openalex.org/W2248800659","https://openalex.org/W2799004609","https://openalex.org/W2912781345","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/W2555559350","https://openalex.org/W2081964190","https://openalex.org/W1968750272","https://openalex.org/W2361465121","https://openalex.org/W2103515372","https://openalex.org/W2607223747"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}