{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T13:58:12Z","timestamp":1775829492151,"version":"3.50.1"},"reference-count":22,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2020,4]]},"abstract":"<jats:p> The [Formula: see text]-ary [Formula: see text]-cube network is known as one of the most attractive interconnection networks for parallel and distributed systems. A many-to-many [Formula: see text]-disjoint path cover ([Formula: see text]-DPC for short) of a graph is a set of [Formula: see text] vertex-disjoint paths joining two disjoint vertex sets [Formula: see text] and [Formula: see text] of equal size [Formula: see text] that altogether cover every vertex of the graph. The many-to-many [Formula: see text]-DPC is classified as paired if each source in [Formula: see text] is further required to be paired with a specific sink in [Formula: see text], or unpaired otherwise. In this paper, we consider the unpaired many-to-many [Formula: see text]-DPC problem of faulty bipartite [Formula: see text]-ary [Formula: see text]-cube networks [Formula: see text], where the sets [Formula: see text] and [Formula: see text] are chosen in different parts of the bipartition. We show that, every bipartite [Formula: see text], under the condition that [Formula: see text] or less faulty edges are removed, has an unpaired many-to-many [Formula: see text]-DPC for any [Formula: see text] and [Formula: see text] subject to [Formula: see text]. The bound [Formula: see text] is tight here. <\/jats:p>","DOI":"10.1142\/s0129054120500148","type":"journal-article","created":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T08:07:29Z","timestamp":1588579649000},"page":"371-383","source":"Crossref","is-referenced-by-count":25,"title":["Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements"],"prefix":"10.1142","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7185-8440","authenticated-orcid":false,"given":"Jing","family":"Li","sequence":"first","affiliation":[{"name":"School of Applied Science, Taiyuan University of Science and Technology, Taiyuan, Shanxi 030024, P. R. China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9491-8757","authenticated-orcid":false,"given":"Chris","family":"Melekian","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, Oakland University, Rochester, Michigan 48309, USA"}]},{"given":"Shurong","family":"Zuo","sequence":"additional","affiliation":[{"name":"School of Applied Science, Taiyuan University of Science and Technology, Taiyuan, Shanxi 030024, P. R. China"}]},{"given":"Eddie","family":"Cheng","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, Oakland University, Rochester, Michigan 48309, USA"}]}],"member":"219","published-online":{"date-parts":[[2020,5,1]]},"reference":[{"key":"S0129054120500148BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.10.010"},{"key":"S0129054120500148BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2015.10.001"},{"key":"S0129054120500148BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.11.007"},{"key":"S0129054120500148BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2009.01.002"},{"key":"S0129054120500148BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.10.008"},{"key":"S0129054120500148BIB006","doi-asserted-by":"publisher","DOI":"10.1109\/CMPCON.1993.289660"},{"key":"S0129054120500148BIB007","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.133"},{"key":"S0129054120500148BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.09.013"},{"key":"S0129054120500148BIB009","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054113500275"},{"key":"S0129054120500148BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.03.008"},{"key":"S0129054120500148BIB011","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054111008532"},{"key":"S0129054120500148BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.05.004"},{"key":"S0129054120500148BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.04.007"},{"key":"S0129054120500148BIB014","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.12.036"},{"key":"S0129054120500148BIB015","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2017.05.007"},{"key":"S0129054120500148BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.12.008"},{"key":"S0129054120500148BIB017","doi-asserted-by":"publisher","DOI":"10.1109\/40.87568"},{"key":"S0129054120500148BIB018","doi-asserted-by":"publisher","DOI":"10.1145\/62044.62050"},{"key":"S0129054120500148BIB019","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.70787"},{"key":"S0129054120500148BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.09.022"},{"key":"S0129054120500148BIB021","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.02.005"},{"key":"S0129054120500148BIB022","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.04.002"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054120500148","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T08:07:30Z","timestamp":1588579650000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054120500148"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4]]},"references-count":22,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["10.1142\/S0129054120500148"],"URL":"https:\/\/doi.org\/10.1142\/s0129054120500148","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4]]}}}