{"id":"https://openalex.org/W1767073862","doi":"https://doi.org/10.1007/978-3-540-30551-4_36","title":"On Compact and Efficient Routing in Certain Graph Classes","display_name":"On Compact and Efficient Routing in Certain Graph Classes","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W1767073862","doi":"https://doi.org/10.1007/978-3-540-30551-4_36","mag":"1767073862"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-30551-4_36","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-30551-4_36","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/A5086851146","display_name":"Feodor F. Dragan","orcid":null},"institutions":[{"id":"https://openalex.org/I149910238","display_name":"Kent State University","ror":"https://ror.org/049pfb863","country_code":"US","type":"education","lineage":["https://openalex.org/I149910238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Feodor F. Dragan","raw_affiliation_strings":["Department of Computer Science, Kent State University, Kent, Ohio, USA","Department of Computer Science, Kent State University, Kent, Ohio"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Kent State University, Kent, Ohio, USA","institution_ids":["https://openalex.org/I149910238"]},{"raw_affiliation_string":"Department of Computer Science, Kent State University, Kent, Ohio","institution_ids":["https://openalex.org/I149910238"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072407156","display_name":"Irina Lomonosov","orcid":null},"institutions":[{"id":"https://openalex.org/I76094744","display_name":"Hiram College","ror":"https://ror.org/02bz74262","country_code":"US","type":"education","lineage":["https://openalex.org/I76094744"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Irina Lomonosov","raw_affiliation_strings":["Department of Computer Science, Hiram College, Hiram, Ohio, USA","Department of Computer Science, Hiram College, Hiram, Ohio#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Hiram College, Hiram, Ohio, USA","institution_ids":["https://openalex.org/I76094744"]},{"raw_affiliation_string":"Department of Computer Science, Hiram College, Hiram, Ohio#TAB#","institution_ids":["https://openalex.org/I76094744"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.9275,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.87047841,"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":"402","last_page":"414"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9993000030517578,"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.7654714584350586},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.7038878798484802},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6608248353004456},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.6130144000053406},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5473783016204834},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5340555906295776},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5131112337112427},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.47793155908584595},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35583481192588806},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.290993869304657},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1915701925754547},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.1216326653957367}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7654714584350586},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.7038878798484802},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6608248353004456},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.6130144000053406},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5473783016204834},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5340555906295776},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5131112337112427},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.47793155908584595},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35583481192588806},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.290993869304657},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1915701925754547},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.1216326653957367}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-540-30551-4_36","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-30551-4_36","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.142.5997","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.5997","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.kent.edu/~dragan/DAM6612.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.68.9289","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.9289","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.kent.edu/~dragan/ISAAC04.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1536817373","https://openalex.org/W1553656314","https://openalex.org/W1579049696","https://openalex.org/W1587867115","https://openalex.org/W1982100216","https://openalex.org/W2007575140","https://openalex.org/W2029448190","https://openalex.org/W2041783376","https://openalex.org/W2057994027","https://openalex.org/W2070631758","https://openalex.org/W2093455937","https://openalex.org/W2133065816","https://openalex.org/W2143474538","https://openalex.org/W2151358465","https://openalex.org/W2158663853","https://openalex.org/W2914484629","https://openalex.org/W4205300528","https://openalex.org/W4299866835"],"related_works":["https://openalex.org/W1987143101","https://openalex.org/W2963009577","https://openalex.org/W2788975631","https://openalex.org/W2903402681","https://openalex.org/W2251679127","https://openalex.org/W1555816812","https://openalex.org/W2407722793","https://openalex.org/W2157783000","https://openalex.org/W2077583413","https://openalex.org/W2028363955"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}