{"id":"https://openalex.org/W1566919978","doi":"https://doi.org/10.1007/978-3-642-02026-1_35","title":"On Disjoint Shortest Paths Routing on the Hypercube","display_name":"On Disjoint Shortest Paths Routing on the Hypercube","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W1566919978","doi":"https://doi.org/10.1007/978-3-642-02026-1_35","mag":"1566919978"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-02026-1_35","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-02026-1_35","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/A5069246449","display_name":"Eddie Cheng","orcid":"https://orcid.org/0000-0003-4526-7983"},"institutions":[{"id":"https://openalex.org/I177721651","display_name":"Oakland University","ror":"https://ror.org/01ythxj32","country_code":"US","type":"education","lineage":["https://openalex.org/I177721651"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eddie Cheng","raw_affiliation_strings":["Dept. of Mathematics and Statistics, Oakland University, USA","Dept. of Mathematics and Statistics, Oakland University, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Mathematics and Statistics, Oakland University, USA","institution_ids":["https://openalex.org/I177721651"]},{"raw_affiliation_string":"Dept. of Mathematics and Statistics, Oakland University, USA#TAB#","institution_ids":["https://openalex.org/I177721651"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008978009","display_name":"Shuhong Gao","orcid":"https://orcid.org/0000-0002-0937-1727"},"institutions":[{"id":"https://openalex.org/I8078737","display_name":"Clemson University","ror":"https://ror.org/037s24f05","country_code":"US","type":"education","lineage":["https://openalex.org/I8078737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shuhong Gao","raw_affiliation_strings":["Dept. of Mathematical Science, Clemson University, USA","Dept. of Mathematical Science, Clemson University, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Mathematical Science, Clemson University, USA","institution_ids":["https://openalex.org/I8078737"]},{"raw_affiliation_string":"Dept. of Mathematical Science, Clemson University, USA#TAB#","institution_ids":["https://openalex.org/I8078737"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103708105","display_name":"Ke Qiu","orcid":"https://orcid.org/0009-0006-8700-2982"},"institutions":[{"id":"https://openalex.org/I186803428","display_name":"Brock University","ror":"https://ror.org/056am2717","country_code":"CA","type":"education","lineage":["https://openalex.org/I186803428"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Ke Qiu","raw_affiliation_strings":["Dept. of Computer Science, Brock University, Canada","Dept of Computer Science, Brock University, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Brock University, Canada","institution_ids":["https://openalex.org/I186803428"]},{"raw_affiliation_string":"Dept of Computer Science, Brock University, Canada","institution_ids":["https://openalex.org/I186803428"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002740825","display_name":"Zhizhang Shen","orcid":"https://orcid.org/0000-0002-5738-6077"},"institutions":[{"id":"https://openalex.org/I89312276","display_name":"Plymouth State University","ror":"https://ror.org/00fpz4c36","country_code":"US","type":"education","lineage":["https://openalex.org/I89312276"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhizhang Shen","raw_affiliation_strings":["Dept. of Computer Science and Technology, Plymouth State University, USA","[Department of Computer Science & Technology, Plymouth State University, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Technology, Plymouth State University, USA","institution_ids":["https://openalex.org/I89312276"]},{"raw_affiliation_string":"[Department of Computer Science & Technology, Plymouth State University, USA]","institution_ids":["https://openalex.org/I89312276"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.4997,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.89078788,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"375","last_page":"383"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":1.0,"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":1.0,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.8595866560935974},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6639817953109741},{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.613292396068573},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.541276216506958},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5266221165657043},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.514517068862915},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.48622265458106995},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4389806091785431},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.42903849482536316},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.413674920797348},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3422595262527466},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.3253660500049591},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2754168212413788},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24789658188819885},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.13984328508377075},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10302472114562988},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.08743119239807129}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.8595866560935974},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6639817953109741},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.613292396068573},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.541276216506958},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5266221165657043},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.514517068862915},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.48622265458106995},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4389806091785431},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.42903849482536316},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.413674920797348},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3422595262527466},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.3253660500049591},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2754168212413788},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24789658188819885},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.13984328508377075},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10302472114562988},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.08743119239807129},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-02026-1_35","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-02026-1_35","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1967259079","https://openalex.org/W1968025843","https://openalex.org/W2010509012","https://openalex.org/W2053913299","https://openalex.org/W2058972589","https://openalex.org/W2063292248","https://openalex.org/W2063916905","https://openalex.org/W2069323107","https://openalex.org/W2091524309","https://openalex.org/W2118797705","https://openalex.org/W2119888753","https://openalex.org/W2157529519","https://openalex.org/W2164322846","https://openalex.org/W2166255004"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W4293054712","https://openalex.org/W2375775343","https://openalex.org/W2388654557","https://openalex.org/W2360981904","https://openalex.org/W2365712669","https://openalex.org/W3094029073","https://openalex.org/W2187099115","https://openalex.org/W2105948570"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}