{"id":"https://openalex.org/W7123354006","doi":"https://doi.org/10.1109/candarw68385.2025.00042","title":"Pairwise Disjoint Paths Routing in Bicubes","display_name":"Pairwise Disjoint Paths Routing in Bicubes","publication_year":2025,"publication_date":"2025-11-25","ids":{"openalex":"https://openalex.org/W7123354006","doi":"https://doi.org/10.1109/candarw68385.2025.00042"},"language":null,"primary_location":{"id":"doi:10.1109/candarw68385.2025.00042","is_oa":false,"landing_page_url":"https://doi.org/10.1109/candarw68385.2025.00042","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 Thirteenth International Symposium on Computing and Networking Workshops (CANDARW)","raw_type":"proceedings-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/A5122907213","display_name":"Yitong Wang","orcid":null},"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":true,"raw_author_name":"Yitong Wang","raw_affiliation_strings":["Tokyo University of Agriculture and Technology,Graduate School of Engineering,Koganei-shi,Tokyo,Japan,184-8588"],"affiliations":[{"raw_affiliation_string":"Tokyo University of Agriculture and Technology,Graduate School of Engineering,Koganei-shi,Tokyo,Japan,184-8588","institution_ids":["https://openalex.org/I92614990"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085581469","display_name":"Kaichi Kaneko","orcid":"https://orcid.org/0000-0002-2082-6948"},"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":["Tokyo University of Agriculture and Technology,Graduate School of Engineering,Koganei-shi,Tokyo,Japan,184-8588"],"affiliations":[{"raw_affiliation_string":"Tokyo University of Agriculture and Technology,Graduate School of Engineering,Koganei-shi,Tokyo,Japan,184-8588","institution_ids":["https://openalex.org/I92614990"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5122907213"],"corresponding_institution_ids":["https://openalex.org/I92614990"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.68416719,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"199","last_page":"202"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9933000206947327,"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.9933000206947327,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.003800000064074993,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.0008999999845400453,"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/hypercube","display_name":"Hypercube","score":0.6876999735832214},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6675999760627747},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.5631999969482422},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.5507000088691711},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5403000116348267},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4880000054836273},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4869000017642975},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.4779999852180481},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4429999887943268}],"concepts":[{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.6876999735832214},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6675999760627747},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.5631999969482422},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.5507000088691711},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5403000116348267},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5044999718666077},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4880000054836273},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4869000017642975},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.4779999852180481},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4429999887943268},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.4377000033855438},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43540000915527344},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4350000023841858},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37720000743865967},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.364300012588501},{"id":"https://openalex.org/C123745756","wikidata":"https://www.wikidata.org/wiki/Q1665949","display_name":"Interconnection","level":2,"score":0.33970001339912415},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.33899998664855957},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.3314000070095062},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3294999897480011},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.30720001459121704},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2971999943256378},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28940001130104065},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28940001130104065},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.2711000144481659},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.26809999346733093},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.2572999894618988},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.2558000087738037}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/candarw68385.2025.00042","is_oa":false,"landing_page_url":"https://doi.org/10.1109/candarw68385.2025.00042","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 Thirteenth International Symposium on Computing and Networking Workshops (CANDARW)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,21],"hypercube":[1,29],"is":[2,15,141,189,198,204,212],"a":[3,16,54,83,96,109],"well-known":[4],"topology":[5,56,69],"for":[6,57,82],"interconnection":[7,59],"networks":[8,60],"of":[9,18,41,61,85,98,166,175,186],"parallel":[10,48,63],"systems,":[11],"and":[12,30,70,95,193,206],"the":[13,19,24,28,34,42,51,58,77,137,157,173,176,183,187,194],"bicube":[14,22,52,162],"variant":[17],"hypercube.":[20],"preserves":[23],"node":[25,131],"symmetry":[26],"like":[27],"it":[31],"significantly":[32],"reduces":[33],"network":[35],"diameter":[36],"to":[37,112,121,146],"about":[38],"half":[39],"that":[40,75,129,140,155,182],"hypercube,":[43],"improving":[44],"communication":[45],"efficiency":[46],"in":[47,108,159,163],"systems.":[49,64],"Therefore,":[50],"provides":[53],"promising":[55],"massively":[62],"We":[65,170],"focus":[66],"on":[67],"this":[68,149],"address":[71],"an":[72,153,160],"unresolved":[73],"problem,":[74],"is,":[76],"pairwise":[78],"disjoint":[79],"paths":[80,118],"problem:":[81],"set":[84,97],"source":[86],"nodes":[87,100],"$\\left\\{s_{1},":[88],"s_{2},":[89],"\\ldots,":[90,103],"s_{\\lceil":[91],"k":[92,105,115,126],"/":[93,106,116,127],"2\\rceil}\\right\\}$":[94,107],"destination":[99],"$\\left\\{\\boldsymbol{d}_{1},":[101],"\\boldsymbol{d}_{2},":[102],"\\boldsymbol{d}_{\\lceil":[104],"k-connected":[110],"graph,":[111],"generate":[113],"$\\lceil":[114,134],"2\\rceil$":[117],"from":[119],"$\\boldsymbol{s}_{i}$":[120],"$\\boldsymbol{d}_{i}(1":[122],"\\leq":[123],"i":[124],"\\leq\\lceil":[125],"2\\rceil)$":[128],"are":[130],"disjoint,":[132],"where":[133],"x\\rceil$":[135],"represents":[136],"smallest":[138],"integer":[139],"more":[142],"than":[143],"or":[144],"equal":[145],"x.":[147],"In":[148],"paper,":[150],"we":[151,179],"propose":[152],"algorithm":[154,188],"solves":[156],"problem":[158],"n-dimensional":[161],"polynomial":[164],"time":[165,184],"its":[167],"degree":[168],"n.":[169],"have":[171,180],"proved":[172],"correctness":[174],"algorithm.":[177],"Moreover,":[178],"shown":[181],"complexity":[185],"$O\\left(n^{2}":[190],"\\log":[191],"n\\right)$,":[192],"maximum":[195],"path":[196],"length":[197],"$2":[199,207],"n+2\\lceil\\log":[200,208],"(n-2)\\rceil+7$":[201],"when":[202,210],"n":[203,211],"odd,":[205],"(n-3)\\rceil+9$":[209],"even.":[213]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2026-01-14T00:00:00"}