{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T16:21:31Z","timestamp":1774455691848,"version":"3.50.1"},"reference-count":22,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["2021R1F1A1048180"],"award-info":[{"award-number":["2021R1F1A1048180"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2023,6]]},"abstract":"<jats:p> Given two disjoint vertex-sets, [Formula: see text] and [Formula: see text] in a graph, a paired many-to-many\u00a0[Formula: see text]-disjoint path cover joining [Formula: see text] and [Formula: see text] is a set of pairwise vertex-disjoint paths [Formula: see text] that altogether cover every vertex of the graph, in which each path [Formula: see text] runs from [Formula: see text] to [Formula: see text]. In this paper, we reveal that a bipartite torus-like graph, if built from lower dimensional torus-like graphs that have good disjoint-path-cover properties, retain such good property. As a result, an [Formula: see text]-dimensional bipartite torus, [Formula: see text], with at most [Formula: see text] edge faults has a paired many-to-many [Formula: see text]-disjoint path cover joining arbitrary disjoint sets [Formula: see text] and [Formula: see text] of size [Formula: see text] each such that [Formula: see text] contains the equal numbers of vertices from different parts of the bipartition. <\/jats:p>","DOI":"10.1142\/s0129054122500241","type":"journal-article","created":{"date-parts":[[2022,11,9]],"date-time":"2022-11-09T16:27:02Z","timestamp":1668011222000},"page":"429-441","source":"Crossref","is-referenced-by-count":6,"title":["Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults"],"prefix":"10.1142","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1052-5746","authenticated-orcid":false,"given":"Jung-Heum","family":"Park","sequence":"first","affiliation":[{"name":"School of Computer Science and Information Engineering, The Catholic University of Korea, Republic of Korea"}]}],"member":"219","published-online":{"date-parts":[[2022,11,9]]},"reference":[{"issue":"3","key":"S0129054122500241BIB001","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/s00453-009-9292-5","volume":"58","author":"Asdre K.","year":"2010","journal-title":"Algorithmica"},{"key":"S0129054122500241BIB003","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.tcs.2017.12.006","volume":"714","author":"Cao H.","year":"2018","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"S0129054122500241BIB004","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.ipl.2015.10.001","volume":"116","author":"Chen X.-B.","year":"2016","journal-title":"Inform. Process. Lett."},{"key":"S0129054122500241BIB005","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/j.ic.2016.10.002","volume":"251","author":"Hsieh S.-Y.","year":"2016","journal-title":"Inform. Comput."},{"key":"S0129054122500241BIB006","doi-asserted-by":"crossref","DOI":"10.1201\/9781420044829","volume-title":"Graph Theory and Interconnection Networks","author":"Hsu L.-H.","year":"2008"},{"key":"S0129054122500241BIB007","first-page":"67","volume-title":"Workshop on Algorithms and Computation WAAC2001","author":"Kim H.-C.","year":"2001"},{"key":"S0129054122500241BIB008","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.dam.2016.09.020","volume":"218","author":"Kronenthal B. G.","year":"2017","journal-title":"Discr. Appl. Math."},{"issue":"2","key":"S0129054122500241BIB009","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1016\/j.disc.2015.10.021","volume":"339","author":"Lim H.-S.","year":"2016","journal-title":"Discr. Math."},{"issue":"3","key":"S0129054122500241BIB010","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1142\/S0129054120500148","volume":"31","author":"Li J.","year":"2020","journal-title":"Int. J. Found. Comput. Sci."},{"key":"S0129054122500241BIB011","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2017.03.008","volume":"677","author":"Li J.","year":"2017","journal-title":"Theoret. Comput. Sci."},{"issue":"8","key":"S0129054122500241BIB012","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1142\/S0129054121500301","volume":"32","author":"L\u00fc H.","year":"2021","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"S0129054122500241BIB013","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1007\/s11227-018-02734-0","volume":"75","author":"L\u00fc H.","year":"2019","journal-title":"The Journal of Supercomputing"},{"key":"S0129054122500241BIB014","first-page":"181","volume":"1489","author":"Makino K.","year":"2006","journal-title":"Publ. Res. Inst. Math. Sci, Kyoto Univ."},{"key":"S0129054122500241BIB015","volume-title":"Algorithmic Graph Theory","author":"McHugh J. A.","year":"1990"},{"key":"S0129054122500241BIB016","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.tcs.2022.02.003","volume":"911","author":"Niu R.","year":"2022","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"S0129054122500241BIB017","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1109\/TSE.1979.234213","volume":"5","author":"Ntafos S. C.","year":"1979","journal-title":"IEEE Trans. Softw. Engin."},{"key":"S0129054122500241BIB018","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/j.dam.2014.12.008","volume":"185","author":"Park J.-H.","year":"2015","journal-title":"Discr. Appl. Math."},{"key":"S0129054122500241BIB019","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ipl.2018.10.010","volume":"142","author":"Park J.-H.","year":"2019","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"S0129054122500241BIB020","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1109\/TPDS.2006.37","volume":"17","author":"Park J.-H.","year":"2006","journal-title":"IEEE Trans. Parallel and Distributed Syst."},{"issue":"4","key":"S0129054122500241BIB021","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1109\/TC.2008.160","volume":"58","author":"Park J.-H.","year":"2009","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"S0129054122500241BIB022","doi-asserted-by":"crossref","first-page":"115","DOI":"10.5626\/JCSE.2018.12.3.115","volume":"12","author":"Park J.-H.","year":"2018","journal-title":"J. Comput. Sci. Engin."},{"key":"S0129054122500241BIB023","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.dam.2020.09.008","volume":"289","author":"Park J.-H.","year":"2021","journal-title":"Discr. Appl. Math."}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054122500241","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T02:16:08Z","timestamp":1685412968000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129054122500241"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,9]]},"references-count":22,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["10.1142\/S0129054122500241"],"URL":"https:\/\/doi.org\/10.1142\/s0129054122500241","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,9]]}}}