{"id":"https://openalex.org/W4290044397","doi":"https://doi.org/10.1109/access.2022.3188783","title":"Set-to-Set Disjoint Path Routing in Bijective Connection Graphs","display_name":"Set-to-Set Disjoint Path Routing in Bijective Connection Graphs","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4290044397","doi":"https://doi.org/10.1109/access.2022.3188783"},"language":"en","primary_location":{"id":"doi:10.1109/access.2022.3188783","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2022.3188783","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/9668973/09815582.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://ieeexplore.ieee.org/ielx7/6287639/9668973/09815582.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014838749","display_name":"Keiichi Kaneko","orcid":"https://orcid.org/0000-0003-1790-4615"},"institutions":[{"id":"https://openalex.org/I92614990","display_name":"Tokyo University of Agriculture and Technology","ror":"https://ror.org/00qg0kr10","country_code":"JP","type":"education","lineage":["https://openalex.org/I92614990"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Keiichi Kaneko","raw_affiliation_strings":["Institute of Engineering, Tokyo University of Agriculture and Technology, Tokyo, Japan"],"raw_orcid":"https://orcid.org/0000-0003-1790-4615","affiliations":[{"raw_affiliation_string":"Institute of Engineering, Tokyo University of Agriculture and Technology, Tokyo, Japan","institution_ids":["https://openalex.org/I92614990"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058447810","display_name":"Antoine Bossard","orcid":"https://orcid.org/0000-0001-9381-9346"},"institutions":[{"id":"https://openalex.org/I41802502","display_name":"Kanagawa University","ror":"https://ror.org/02j6c0d67","country_code":"JP","type":"education","lineage":["https://openalex.org/I41802502"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Antoine Bossard","raw_affiliation_strings":["Graduate School of Science, Kanagawa University, Hiratsuka, Japan"],"raw_orcid":"https://orcid.org/0000-0001-9381-9346","affiliations":[{"raw_affiliation_string":"Graduate School of Science, Kanagawa University, Hiratsuka, Japan","institution_ids":["https://openalex.org/I41802502"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101893887","display_name":"J. S. Harris","orcid":"https://orcid.org/0000-0002-0857-6931"},"institutions":[{"id":"https://openalex.org/I134113660","display_name":"University of Nevada, Reno","ror":"https://ror.org/01keh0577","country_code":"US","type":"education","lineage":["https://openalex.org/I134113660"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Frederick C. Harris","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Nevada, Reno, Reno, NV, USA"],"raw_orcid":"https://orcid.org/0000-0002-0857-6931","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Nevada, Reno, Reno, NV, USA","institution_ids":["https://openalex.org/I134113660"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":0.3409,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.5784578,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"10","issue":null,"first_page":"72731","last_page":"72742"},"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.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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9990000128746033,"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/bijection","display_name":"Bijection","score":0.6886598467826843},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6769517660140991},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.6033271551132202},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5913370251655579},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5214545130729675},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5172424912452698},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4499111473560333},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.409822940826416},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.345203161239624},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3348177671432495},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.16413912177085876}],"concepts":[{"id":"https://openalex.org/C24424167","wikidata":"https://www.wikidata.org/wiki/Q180907","display_name":"Bijection","level":2,"score":0.6886598467826843},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6769517660140991},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.6033271551132202},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5913370251655579},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5214545130729675},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5172424912452698},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4499111473560333},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.409822940826416},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.345203161239624},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3348177671432495},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16413912177085876},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2022.3188783","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2022.3188783","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/9668973/09815582.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:cc068aaebf70406583f1bb3e65b38a18","is_oa":true,"landing_page_url":"https://doaj.org/article/cc068aaebf70406583f1bb3e65b38a18","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"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":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 10, Pp 72731-72742 (2022)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2022.3188783","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2022.3188783","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/9668973/09815582.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3319884898","display_name":"Investigation of a High-performance Stochastic Link-Fault Tolerant Routing Method in Torus with Wide Dimensions","funder_award_id":"20K11729","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G5534454343","display_name":"Cluster-fault-tolerant routing methods in tori","funder_award_id":"19K11887","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4290044397.pdf","grobid_xml":"https://content.openalex.org/works/W4290044397.grobid-xml"},"referenced_works_count":61,"referenced_works":["https://openalex.org/W636288051","https://openalex.org/W842981885","https://openalex.org/W1500478216","https://openalex.org/W1544862944","https://openalex.org/W1589576801","https://openalex.org/W1875581589","https://openalex.org/W1961498537","https://openalex.org/W1964155402","https://openalex.org/W1964602554","https://openalex.org/W1967259079","https://openalex.org/W1981042553","https://openalex.org/W1982738081","https://openalex.org/W1990807547","https://openalex.org/W1997748822","https://openalex.org/W2004008600","https://openalex.org/W2004178113","https://openalex.org/W2010601119","https://openalex.org/W2013976694","https://openalex.org/W2022265150","https://openalex.org/W2023415255","https://openalex.org/W2036007014","https://openalex.org/W2039097236","https://openalex.org/W2057613339","https://openalex.org/W2065410746","https://openalex.org/W2070979416","https://openalex.org/W2073491596","https://openalex.org/W2077645128","https://openalex.org/W2084476524","https://openalex.org/W2090937823","https://openalex.org/W2114119464","https://openalex.org/W2118323567","https://openalex.org/W2118797705","https://openalex.org/W2122056736","https://openalex.org/W2130401388","https://openalex.org/W2154837657","https://openalex.org/W2161950066","https://openalex.org/W2166255004","https://openalex.org/W2171208587","https://openalex.org/W2179233908","https://openalex.org/W2331759120","https://openalex.org/W2404873901","https://openalex.org/W2408397790","https://openalex.org/W2415642731","https://openalex.org/W2561892450","https://openalex.org/W2604636487","https://openalex.org/W2737473534","https://openalex.org/W2741878740","https://openalex.org/W2905511305","https://openalex.org/W2913146597","https://openalex.org/W2950263197","https://openalex.org/W2998405848","https://openalex.org/W3093964144","https://openalex.org/W4238250996","https://openalex.org/W4247113301","https://openalex.org/W4249149674","https://openalex.org/W6620590407","https://openalex.org/W6650007829","https://openalex.org/W6685066467","https://openalex.org/W6713750179","https://openalex.org/W6714052161","https://openalex.org/W6715837597"],"related_works":["https://openalex.org/W4288805235","https://openalex.org/W2952259524","https://openalex.org/W1508013399","https://openalex.org/W2995857455","https://openalex.org/W2027277382","https://openalex.org/W4287020903","https://openalex.org/W2998840281","https://openalex.org/W4283804497","https://openalex.org/W2950674028","https://openalex.org/W2390235546"],"abstract_inverted_index":{"The":[0,43],"bijective":[1,11,40,143,187],"connection":[2,12,41,144,188],"graph":[3,189],"encompasses":[4],"a":[5,52,66,97,152,174,178,186],"family":[6],"of":[7,20,54,68,139,154,156,164,185,197],"cube-based":[8],"topologies,":[9],"and$n$-dimensional":[10],"graphs":[13,145],"include":[14],"the":[15,24,26,93,114,120,157,162,165,168,193,198,202],"hypercube":[16],"and":[17,34,108,119,201],"almost":[18],"all":[19],"its":[21],"variants":[22],"with":[23],"order$2^{n}$and":[25],"degree$n$.":[27],"Hence,":[28],"it":[29],"is":[30,48,102],"important":[31,104],"to":[32,99,173,190],"design":[33],"implement":[35],"algorithms":[36],"that":[37,132],"work":[38],"in":[39,106,146,177],"graphs.":[42],"set-to-set":[44],"disjoint":[45,116,122],"paths":[46,117,123,135],"problem":[47,101,118],"as":[49,111,113,159,161,182],"follows:":[50],"given":[51],"set":[53,67],"source":[55],"nodes$S=\\{":[56],"\\boldsymbol":[57,60,63,71,74,77,86],"s":[58,61,64,84],"_{1},":[59,73],"_{2},\\ldots,":[62,76],"_{p}\\}$and":[65],"destination":[69],"nodes$D=\\{":[70],"d":[72,75,78,87],"_{p}\\}$in":[79],"a$k$-connected":[80],"graph$G=(V,E)$with$p\\le":[81],"k$,":[82],"construct$p$paths$P_{i}$:$\\boldsymbol":[83],"_{i}\\leadsto":[85],"_{j_{i}}$($1\\le":[88],"i\\le":[89],"p$)":[90],"such":[91],"that$\\{j_{1},j_{2},\\ldots,j_{p}\\}=\\{1,2,\\ldots,p\\}$and":[92],"paths$P_{i}$are":[94],"node-disjoint.":[95],"Finding":[96],"solution":[98],"this":[100,126],"an":[103,130,183],"issue":[105],"parallel":[107],"distributed":[109],"computation":[110],"well":[112,160],"node-to-node":[115],"node-to-set":[121],"problem.":[124],"In":[125],"paper":[127],"we":[128],"propose":[129],"algorithm":[131,158,199],"constructs$p~(\\le":[133],"n)$disjoint":[134],"between":[136],"any":[137],"pair":[138],"node":[140],"sets":[141],"in$n$-dimensional":[142],"polynomial-order":[147],"time":[148,166,195],"of$n$.":[149],"We":[150],"give":[151],"proof":[153],"correctness":[155],"estimates":[163],"complexity$O(n^{3}p^{4})$and":[167],"maximum":[169,204],"path":[170,205],"length$n+p-1$.":[171],"According":[172],"computer":[175],"experiment":[176],"locally":[179],"twisted":[180],"cube":[181],"example":[184],"construct$n$disjoint":[191],"paths,":[192],"average":[194,203],"complexity":[196],"is$O(n^{2})$,":[200],"is$0.6333n-0.266$.":[206]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}