{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T05:25:59Z","timestamp":1740201959237,"version":"3.37.3"},"reference-count":0,"publisher":"IOS Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"abstract":"<jats:p>A one-to-two disjoint-path cover of a graph G is a pair (P1, P2) of two vertex-disjoint paths that connect one source to two sinks in G and span G. It is called &amp;epsiv;-balanced if |&amp;ell;&amp;lpar;P1&amp;rpar;&amp;minus;&amp;ell;&amp;lpar;P2&amp;rpar;|=&amp;epsiv;, where &amp;ell;&amp;lpar;P1&amp;rpar; and &amp;ell;&amp;lpar;P2) denote the lengths of paths P1and P2, respectively. The matching composition network is a family of interconnection networks, each of which connects two components with the same number of vertices by a perfect matching. This paper addresses some properties about one-to-two disjoint-path covers of matching composition networks. Applying the proposed main theorem, a one-to-two &amp;epsiv;-balanced disjoint-path cover in some well-known interconnection networks, such as crossed cubes, twisted cubes, locally twisted cubes, etc., can be easily obtained for a given odd integer &amp;epsiv;.<\/jats:p>","DOI":"10.3233\/978-1-61499-484-8-67","type":"book-chapter","created":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:27:24Z","timestamp":1740133644000},"source":"Crossref","is-referenced-by-count":0,"title":["Toward the One-to-Two Balanced Disjoint-Path Cover of Matching Composition Networks"],"prefix":"10.3233","author":[{"family":"Kung Tzu-Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Chen Hon-Chan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Hsu Lih-Hsing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Wang Chi-Lun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","Intelligent Systems and Applications"],"original-title":[],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:28:02Z","timestamp":1740133682000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospressISSNISBN&issn=0922-6389&volume=274&spage=67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/978-1-61499-484-8-67","relation":{},"ISSN":["0922-6389"],"issn-type":[{"value":"0922-6389","type":"print"}],"subject":[],"published":{"date-parts":[[2015]]}}}