{"id":"https://openalex.org/W2063048655","doi":"https://doi.org/10.1007/bf01762113","title":"Designing networks with compact routing tables","display_name":"Designing networks with compact routing tables","publication_year":1988,"publication_date":"1988-11-01","ids":{"openalex":"https://openalex.org/W2063048655","doi":"https://doi.org/10.1007/bf01762113","mag":"2063048655"},"language":"en","primary_location":{"id":"doi:10.1007/bf01762113","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01762113","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/A5015188847","display_name":"Greg N. Frederickson","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Greg N. Frederickson","raw_affiliation_strings":["Department of Computer Science, Purdue University, 47907, West Lafayette, IN, USA","Purdue University"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Purdue University, 47907, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"Purdue University","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050894676","display_name":"Ravi Janardan","orcid":"https://orcid.org/0000-0003-3922-6763"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ravi Janardan","raw_affiliation_strings":["Department of Computer Science, Purdue University, 47907, West Lafayette, IN, USA","Purdue University"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Purdue University, 47907, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"Purdue University","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5015188847"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":6.8914,"has_fulltext":false,"cited_by_count":135,"citation_normalized_percentile":{"value":0.97442964,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"3","issue":"1-4","first_page":"171","last_page":"190"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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.9991000294685364,"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.9986000061035156,"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/T12029","display_name":"DNA and Biological Computing","score":0.9986000061035156,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.6644828915596008},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6037427186965942},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5791826248168945},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5274118185043335},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.517530620098114},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5075041651725769},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5062884092330933},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4973659813404083},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.4665524661540985},{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.44254615902900696},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.44204413890838623},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43546634912490845},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.41473934054374695},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4037899971008301},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36434873938560486},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3172919750213623},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.18745043873786926},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10722362995147705},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.10352504253387451}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6644828915596008},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6037427186965942},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5791826248168945},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5274118185043335},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.517530620098114},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5075041651725769},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5062884092330933},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4973659813404083},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.4665524661540985},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.44254615902900696},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.44204413890838623},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43546634912490845},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.41473934054374695},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4037899971008301},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36434873938560486},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3172919750213623},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.18745043873786926},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10722362995147705},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.10352504253387451},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01762113","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01762113","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":[{"score":0.4099999964237213,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W855674090","https://openalex.org/W1511174345","https://openalex.org/W1655990431","https://openalex.org/W1983433417","https://openalex.org/W1992636056","https://openalex.org/W2038643780","https://openalex.org/W2040391409","https://openalex.org/W2062403584","https://openalex.org/W2079103108","https://openalex.org/W2090972269","https://openalex.org/W2104734478","https://openalex.org/W2151358465","https://openalex.org/W2799004609","https://openalex.org/W2914484629","https://openalex.org/W4213214460"],"related_works":["https://openalex.org/W4286907761","https://openalex.org/W2916710807","https://openalex.org/W2413588304","https://openalex.org/W2009411567","https://openalex.org/W3205447645","https://openalex.org/W2097769911","https://openalex.org/W2371629703","https://openalex.org/W2774705104","https://openalex.org/W72835634","https://openalex.org/W2133808983"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}