{"id":"https://openalex.org/W2156880885","doi":"https://doi.org/10.1109/prdc.2004.1276568","title":"Node-to-node internally disjoint paths problem in bubble-sort graphs","display_name":"Node-to-node internally disjoint paths problem in bubble-sort graphs","publication_year":2004,"publication_date":"2004-06-10","ids":{"openalex":"https://openalex.org/W2156880885","doi":"https://doi.org/10.1109/prdc.2004.1276568","mag":"2156880885"},"language":"en","primary_location":{"id":"doi:10.1109/prdc.2004.1276568","is_oa":false,"landing_page_url":"https://doi.org/10.1109/prdc.2004.1276568","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings.","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/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":true,"raw_author_name":"K. Kaneko","raw_affiliation_strings":["Department of Computer, Information and Communication Sciences, Faculty of Technology, Tokyo University of Agriculture\u00a0and\u00a0Technology, Koganei, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Computer, Information and Communication Sciences, Faculty of Technology, Tokyo University of Agriculture\u00a0and\u00a0Technology, Koganei, Tokyo, Japan","institution_ids":["https://openalex.org/I92614990"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111889008","display_name":"Yasuto Suzuki","orcid":"https://orcid.org/0009-0008-3373-9414"},"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":"Y. Suzuki","raw_affiliation_strings":["Department of Computer, Information and Communication Sciences, Faculty of Technology, Tokyo University of Agriculture\u00a0and\u00a0Technology, Koganei, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Computer, Information and Communication Sciences, Faculty of Technology, Tokyo University of Agriculture\u00a0and\u00a0Technology, Koganei, Tokyo, Japan","institution_ids":["https://openalex.org/I92614990"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5014838749"],"corresponding_institution_ids":["https://openalex.org/I92614990"],"apc_list":null,"apc_paid":null,"fwci":1.6223,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.87290907,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"173","last_page":"182"},"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.9948999881744385,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9857000112533569,"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/correctness","display_name":"Correctness","score":0.704461395740509},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6026486158370972},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6013656258583069},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5414860248565674},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.5320148468017578},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5012040138244629},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.44480639696121216},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42314234375953674},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4179735779762268},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39735913276672363},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3907119333744049},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35817524790763855},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35262858867645264},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34420016407966614}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.704461395740509},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6026486158370972},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6013656258583069},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5414860248565674},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.5320148468017578},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5012040138244629},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.44480639696121216},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42314234375953674},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4179735779762268},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39735913276672363},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3907119333744049},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35817524790763855},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35262858867645264},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34420016407966614},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/prdc.2004.1276568","is_oa":false,"landing_page_url":"https://doi.org/10.1109/prdc.2004.1276568","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings.","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W54530550","https://openalex.org/W1500478216","https://openalex.org/W1589543978","https://openalex.org/W1964602554","https://openalex.org/W1973518576","https://openalex.org/W1992102896","https://openalex.org/W1994381924","https://openalex.org/W1998956881","https://openalex.org/W2004008600","https://openalex.org/W2006915927","https://openalex.org/W2012554323","https://openalex.org/W2023415255","https://openalex.org/W2046805643","https://openalex.org/W2058972589","https://openalex.org/W2073491596","https://openalex.org/W2104670209","https://openalex.org/W2104852618","https://openalex.org/W2118293675","https://openalex.org/W2118354649","https://openalex.org/W2143590211","https://openalex.org/W2155781858","https://openalex.org/W2166255004","https://openalex.org/W2171208587","https://openalex.org/W2415642731","https://openalex.org/W2561892450","https://openalex.org/W3137132082","https://openalex.org/W6635230918","https://openalex.org/W6650007829","https://openalex.org/W6678131956","https://openalex.org/W6685066467","https://openalex.org/W6715837597","https://openalex.org/W6792259007"],"related_works":["https://openalex.org/W1667647204","https://openalex.org/W2404647514","https://openalex.org/W4247536566","https://openalex.org/W2018477250","https://openalex.org/W3119814709","https://openalex.org/W4241418540","https://openalex.org/W3134175203","https://openalex.org/W3002909018","https://openalex.org/W1589381382","https://openalex.org/W961142965"],"abstract_inverted_index":{"A":[0],"bubble-sort":[1,32],"graph":[2,61],"is":[3,11,56],"a":[4,14],"variant":[5],"of":[6,21,50,53,59,69,75,82,90,97],"Cayley":[7],"graphs":[8,33],"and":[9,24,34,72],"it":[10],"suitable":[12],"as":[13],"topology":[15],"for":[16],"massively":[17],"parallel":[18],"systems":[19],"because":[20],"its":[22],"simple":[23],"regular":[25],"structure.":[26],"Therefore,":[27],"we":[28,86],"focus":[29],"on":[30],"nth":[31],"propose":[35],"an":[36],"algorithm":[37,71],"to":[38,93],"obtain":[39],"n-1":[40],"disjoint":[41],"paths":[42],"between":[43],"arbitrary":[44],"two":[45],"nodes":[46],"in":[47],"the":[48,57,60,66,70,73,80,83,88,98],"complexity":[49,68],"polynomial":[51],"order":[52],"n":[54],"which":[55],"degree":[58],"plus":[62],"one.":[63],"We":[64],"estimate":[65],"time":[67],"sum":[74],"path":[76],"lengths":[77],"after":[78],"proving":[79],"correctness":[81],"algorithm.":[84,99],"Moreover,":[85],"report":[87],"results":[89],"computer":[91],"experiment":[92],"evaluate":[94],"average":[95],"performance":[96]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}