{"id":"https://openalex.org/W3093964144","doi":"https://doi.org/10.1109/access.2020.3032684","title":"Pairwise Disjoint Paths Routing in Tori","display_name":"Pairwise Disjoint Paths Routing in Tori","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3093964144","doi":"https://doi.org/10.1109/access.2020.3032684","mag":"3093964144"},"language":"en","primary_location":{"id":"doi:10.1109/access.2020.3032684","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.3032684","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8948470/09234411.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/8948470/09234411.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","ORCiD"],"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"]},{"raw_affiliation_string":"ORCiD","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112437578","display_name":"Son Nguyen","orcid":"https://orcid.org/0000-0001-8188-4984"},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Son Van Nguyen","raw_affiliation_strings":["School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam","ORCiD"],"raw_orcid":"https://orcid.org/0000-0001-8188-4984","affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]},{"raw_affiliation_string":"ORCiD","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113920317","display_name":"Hyunh Thi Thanh Binh","orcid":null},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Hyunh Thi Thanh Binh","raw_affiliation_strings":["School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam","ORCiD"],"raw_orcid":"https://orcid.org/0000-0003-1976-6113","affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]},{"raw_affiliation_string":"ORCiD","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"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":1.0819,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.79827404,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"8","issue":null,"first_page":"192206","last_page":"192217"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9980999827384949,"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.9952999949455261,"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/disjoint-sets","display_name":"Disjoint sets","score":0.8165997266769409},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5558990836143494},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5074514746665955},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4972727596759796},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.48222291469573975},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45328736305236816},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44939476251602173},{"id":"https://openalex.org/keywords/torus","display_name":"Torus","score":0.4398620128631592},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.42644357681274414},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37937796115875244},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3321140706539154},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29400014877319336},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20702004432678223},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08797314763069153},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.06371048092842102}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.8165997266769409},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5558990836143494},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5074514746665955},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4972727596759796},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48222291469573975},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45328736305236816},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44939476251602173},{"id":"https://openalex.org/C9767117","wikidata":"https://www.wikidata.org/wiki/Q12510","display_name":"Torus","level":2,"score":0.4398620128631592},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.42644357681274414},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37937796115875244},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3321140706539154},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29400014877319336},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20702004432678223},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08797314763069153},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.06371048092842102},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2020.3032684","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.3032684","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8948470/09234411.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:59732e3d12d04ee09ffdc8250f875328","is_oa":true,"landing_page_url":"https://doaj.org/article/59732e3d12d04ee09ffdc8250f875328","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 8, Pp 192206-192217 (2020)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2020.3032684","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.3032684","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8948470/09234411.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":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3093964144.pdf","grobid_xml":"https://content.openalex.org/works/W3093964144.grobid-xml"},"referenced_works_count":41,"referenced_works":["https://openalex.org/W42780094","https://openalex.org/W282449985","https://openalex.org/W1578760407","https://openalex.org/W1589576801","https://openalex.org/W1852491778","https://openalex.org/W1872245744","https://openalex.org/W1964155402","https://openalex.org/W1964602554","https://openalex.org/W1968025843","https://openalex.org/W1973518576","https://openalex.org/W1981042553","https://openalex.org/W1982738081","https://openalex.org/W2004178113","https://openalex.org/W2013976694","https://openalex.org/W2022265150","https://openalex.org/W2022794676","https://openalex.org/W2023415255","https://openalex.org/W2057613339","https://openalex.org/W2065410746","https://openalex.org/W2078251353","https://openalex.org/W2084476524","https://openalex.org/W2090937823","https://openalex.org/W2118323567","https://openalex.org/W2118797705","https://openalex.org/W2120120110","https://openalex.org/W2124470961","https://openalex.org/W2137072805","https://openalex.org/W2144245981","https://openalex.org/W2154837657","https://openalex.org/W2161950066","https://openalex.org/W2179233908","https://openalex.org/W2331759120","https://openalex.org/W2693154466","https://openalex.org/W2737473534","https://openalex.org/W2741878740","https://openalex.org/W2900885752","https://openalex.org/W3169463464","https://openalex.org/W4238250996","https://openalex.org/W4247113301","https://openalex.org/W4249149674","https://openalex.org/W6601677616"],"related_works":["https://openalex.org/W2487162673","https://openalex.org/W2793211469","https://openalex.org/W2949152769","https://openalex.org/W4372354731","https://openalex.org/W2942366970","https://openalex.org/W4256429076","https://openalex.org/W2807634898","https://openalex.org/W1971174658","https://openalex.org/W2020053772","https://openalex.org/W2035433397"],"abstract_inverted_index":{"The":[0,124,208],"pairwise":[1],"disjoint":[2,9,67,72,78,108],"paths":[3,10,68,73,79,109,218],"problem":[4,59,91],"is":[5,50,56,130,141,165,200,206,234,244,292,302,310],"to":[6,187,196,230,237,252,268,284],"construct":[7],"c":[8,111,121],"s":[11],"<sub":[12,17,31,36],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[13,18,32,37,133,157,240,306,323],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">i</sub>":[14,19,33,38],"\u2192":[15],"d":[16,35],"(1":[20,40],"\u2264":[21,23,41,43,122],"i":[22,42],"c)":[24,44],"between":[25,110],"given":[26],"pairs":[27,112],"of":[28,113,127,154,280,299,317],"nodes":[29,114],"(s":[30],",":[34],")":[39,325],"in":[45,115,147,326],"a":[46,57,93,96,116,151,263,277],"graph":[47],"whose":[48],"connectivity":[49],"no":[51],"less":[52],"than":[53,312],"2c.":[54],"It":[55],"major":[58],"for":[60,92],"interconnection":[61],"networks,":[62],"together":[63],"with":[64,266,282],"the":[65,70,76,137,144,178,190,217,224,253,269,285,295,313,318,327],"node-to-node":[66],"problem,":[69,74],"node-to-set":[71],"and":[75,100,136,160,202,223,236,258],"set-to-set":[77],"problem.":[80],"In":[81,95],"this":[82,90,148],"paper,":[83],"we":[84],"propose":[85],"an":[86,104,184],"algorithm":[87,105,129,145,255,261,301,320],"that":[88,106,189,294],"solves":[89],"torus.":[94],"previous":[97,179,254,319],"work,":[98],"Bossard":[99,257],"Kaneko":[101],"have":[102],"developed":[103],"constructs":[107],"k-ary":[117],"n-dimensional":[118],"torus,":[119],"where":[120],"n.":[123],"time":[125,152,227,298,316],"complexity":[126,153],"their":[128],"O(c":[131,155],"<sup":[132,156,239,305,322],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">4</sup>":[134],"n+kcn),":[135,159],"maximum":[138,162,210,270,287],"path":[139,163,192,211,271,288],"length":[140,164],"[k/2jn+2k(c-1).":[142],"However,":[143],"proposed":[146],"paper":[149],"achieves":[150,262],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">3</sup>":[158,324],"its":[161],"[k/2jn":[166],"+":[167],"([3k/21":[168],"-":[169,171],"2)(c":[170],"1),":[172],"which":[173,309],"are":[174,194],"both":[175,274],"improvements":[176],"over":[177],"algorithm.":[180],"We":[181],"also":[182],"conducted":[183],"evaluation":[185],"experiment":[186],"show":[188,249],"average":[191,225,286,296,314],"lengths":[193,212],"proportional":[195,229],"k":[197,205,231,243],"if":[198,204,232,242],"n":[199,233,238],"fixed,":[201,235],"ton":[203],"fixed.":[207,245],"theoretical":[209],"were":[213],"not":[214],"attained":[215],"by":[216,220,256],"constructed":[219],"our":[221,260,300],"algorithm,":[222],"execution":[226,297,315],"was":[228],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[241,307],"Additional":[246],"experimental":[247,328],"results":[248],"that,":[250],"compared":[251],"Kaneko,":[259],"better":[264,311],"performance":[265,281],"respect":[267,283],"lengths,":[272],"but":[273],"algorithms":[275],"achieve":[276],"similar":[278],"level":[279],"lengths.":[289],"Also,":[290],"it":[291],"shown":[293],"about":[303],"O(n":[304,321],"),":[308],"framework.":[329]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}