{"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":1774455691819,"version":"3.50.1"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"Korean Government","doi-asserted-by":"publisher","award":["2021R1F1A1048180"],"award-info":[{"award-number":["2021R1F1A1048180"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002648","name":"Catholic University of Korea, Research Fund, 2022","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002648","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/access.2022.3226687","type":"journal-article","created":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T22:50:12Z","timestamp":1670280612000},"page":"127589-127600","source":"Crossref","is-referenced-by-count":11,"title":["Unpaired Many-to-Many Disjoint Path Covers in Nonbipartite Torus-Like Graphs With Faulty Elements"],"prefix":"10.1109","volume":"10","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, Catholic University of Korea, Bucheon, Republic of Korea"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2006.37"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.160"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2020.09.008"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2015.10.021"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2018.10.010"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1007\/s11227-018-02734-0","article-title":"Paired many-to-many two-disjoint path cover of balanced hypercubes with faulty edges","volume":"75","author":"l\u00fc","year":"2019","journal-title":"J Supercomput"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1142\/S0129054121500301","article-title":"Unpaired many-to-many disjoint path cover of balanced hypercubes","volume":"32","author":"l\u00fc","year":"2021","journal-title":"Int J Found Comput Sci"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2016.10.002"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2022.02.003"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.133"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.12.036"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/26.179933"},{"key":"ref27","first-page":"42","article-title":"Many-to-many disjoint path covers in two-dimensional tori","volume":"38","author":"park","year":"2011","journal-title":"J KISS Comput Syst Theory"},{"key":"ref3","author":"mchugh","year":"1990","journal-title":"Algorithmic Graph Theory"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1979.234213"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(80)90158-2"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3197288"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3061600"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1201\/9781420044829"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-009-9292-5"},{"key":"ref1","author":"parhami","year":"2006","journal-title":"Introduction to Parallel Processing Algorithms and Architectures"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.12.006"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.03.008"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.5626\/JOK.2021.48.12.1251"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054120500148"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054122500241"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.09.020"},{"key":"ref25","first-page":"67","article-title":"Paths and cycles in d-dimensional tori with faults","author":"kim","year":"2001","journal-title":"Proc Workshop Algorithms Comput (WAAC)"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9668973\/09970333.pdf?arnumber=9970333","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T21:26:42Z","timestamp":1673299602000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9970333\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/access.2022.3226687","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}