{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T16:21:27Z","timestamp":1774455687590,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T00:00:00Z","timestamp":1729555200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T00:00:00Z","timestamp":1729555200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["2021R1F1A1048180"],"award-info":[{"award-number":["2021R1F1A1048180"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s11227-024-06572-1","type":"journal-article","created":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T04:04:23Z","timestamp":1729569863000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Unpaired disjoint path covers in bipartite torus-like graphs with edge faults"],"prefix":"10.1007","volume":"81","author":[{"given":"Jung-Heum","family":"Park","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,22]]},"reference":[{"issue":"3","key":"6572_CR1","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/s00453-009-9292-5","volume":"58","author":"K Asdre","year":"2010","unstructured":"Asdre K, Nikolopoulos SD (2010) The 1-fixed-endpoint path cover problem is polynomial on interval graphs. Algorithmica 58(3):679\u2013710","journal-title":"Algorithmica"},{"key":"6572_CR2","doi-asserted-by":"crossref","unstructured":"Bondy JA, Murty USR (2008) Graph theory, 2nd printing","DOI":"10.1007\/978-1-84628-970-5"},{"key":"6572_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.tcs.2017.12.006","volume":"714","author":"H Cao","year":"2018","unstructured":"Cao H, Zhang B, Zhou Z (2018) One-to-one disjoint path covers in digraphs. Theor Comput Sci 714:27\u201335","journal-title":"Theor Comput Sci"},{"issue":"2","key":"6572_CR4","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.ipl.2015.10.001","volume":"116","author":"XB Chen","year":"2016","unstructured":"Chen XB (2016) Paired 2-disjoint path covers of multidimensional torus networks with faulty edges. Inf Process Lett 116(2):107\u2013110","journal-title":"Inf Process Lett"},{"key":"6572_CR5","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.tcs.2017.01.010","volume":"668","author":"T Dvo\u0159\u00e1k","year":"2017","unstructured":"Dvo\u0159\u00e1k T, Gregor P, Koubek V (2017) Generalized gray codes with prescribed ends. Theor Comput Sci 668:70\u201394","journal-title":"Theor Comput Sci"},{"key":"6572_CR6","doi-asserted-by":"crossref","unstructured":"Dvo\u0159\u00e1k T, Koubek V (2017) Generalized gray codes with prescribed ends of small dimensions. arXiv preprint arXiv:1701.06705","DOI":"10.1016\/j.tcs.2017.01.010"},{"key":"6572_CR7","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/j.ic.2016.10.002","volume":"251","author":"SY Hsieh","year":"2016","unstructured":"Hsieh SY, Lee CW, Huang CH (2016) Conditional edge-fault hamiltonian-connectivity of restricted hypercube-like networks. Inf Comput 251:314\u2013334","journal-title":"Inf Comput"},{"key":"6572_CR8","doi-asserted-by":"publisher","DOI":"10.1201\/9781420044829","volume-title":"Graph Theory and Interconnection Networks","author":"LH Hsu","year":"2008","unstructured":"Hsu LH, Lin CK (2008) Graph Theory and Interconnection Networks. CRC Press, USA"},{"key":"6572_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2013.10.008","volume":"513","author":"S Jo","year":"2013","unstructured":"Jo S, Park JH, Chwa KY (2013) Paired many-to-many disjoint path covers in faulty hypercubes. Theor Comput Sci 513:1\u201324","journal-title":"Theor Comput Sci"},{"key":"6572_CR10","unstructured":"Kim HC, Park JH (2001) Paths and cycles in $$d$$-dimensional tori with faults. In: Workshop on Algorithms and Computation WAAC2001, pp. 67\u201374"},{"key":"6572_CR11","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.dam.2016.09.020","volume":"218","author":"BG Kronenthal","year":"2017","unstructured":"Kronenthal BG, Wong WHT (2017) Paired many-to-many disjoint path covers of hypertori. Discrete Appl Math 218:14\u201320","journal-title":"Discrete Appl Math"},{"issue":"3","key":"6572_CR12","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1142\/S0129054120500148","volume":"31","author":"J Li","year":"2020","unstructured":"Li J, Melekian C, Zuo S, Cheng E (2020) Unpaired many-to-many disjoint path covers on bipartite $$k$$-ary $$n$$-cube networks with faulty elements. Int J Found Comput Sci 31(3):371\u2013383","journal-title":"Int J Found Comput Sci"},{"key":"6572_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2017.03.008","volume":"677","author":"J Li","year":"2017","unstructured":"Li J, Wang G, Chen L (2017) Paired 2-disjoint path covers of multi-dimensional torus networks with $$2n-3$$ faulty edges. Theor Comput Sci 677:1\u201311","journal-title":"Theor Comput Sci"},{"issue":"2","key":"6572_CR14","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1016\/j.disc.2015.10.021","volume":"339","author":"HS Lim","year":"2016","unstructured":"Lim HS, Kim HC, Park JH (2016) Ore-type degree conditions for disjoint path covers in simple graphs. Discrete Math 339(2):770\u2013779","journal-title":"Discrete Math"},{"issue":"1","key":"6572_CR15","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/s11227-018-02734-0","volume":"75","author":"H L\u00fc","year":"2019","unstructured":"L\u00fc H (2019) Paired many-to-many two-disjoint path cover of balanced hypercubes with faulty edges. J Supercomput 75(1):400\u2013424","journal-title":"J Supercomput"},{"issue":"8","key":"6572_CR16","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1142\/S0129054121500301","volume":"32","author":"H L\u00fc","year":"2021","unstructured":"L\u00fc H, Wu T (2021) Unpaired many-to-many disjoint path cover of balanced hypercubes. Int J Found Comput Sci 32(8):943\u2013956","journal-title":"Int J Found Comput Sci"},{"issue":"8","key":"6572_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2023.113401","volume":"346","author":"A Ma","year":"2023","unstructured":"Ma A, Sun Y, Zhang X (2023) A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs. Discrete Math 346(8):113401","journal-title":"Discrete Math"},{"key":"6572_CR18","volume-title":"Algorithmic Graph Theory","author":"JA McHugh","year":"1990","unstructured":"McHugh JA (1990) Algorithmic Graph Theory. Prentice-Hall, New Jersey"},{"key":"6572_CR19","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.tcs.2022.02.003","volume":"911","author":"R Niu","year":"2022","unstructured":"Niu R, Xu M (2022) The unpaired many-to-many $$k$$-disjoint paths in bipartite hypercube-like networks. Theor Comput Sc 911:26\u201340","journal-title":"Theor Comput Sc"},{"issue":"5","key":"6572_CR20","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1109\/TSE.1979.234213","volume":"5","author":"SC Ntafos","year":"1979","unstructured":"Ntafos SC, Hakimi SL (1979) On path cover problems in digraphs and applications to program testing. IEEE Trans Soft Eng 5(5):520\u2013529","journal-title":"IEEE Trans Soft Eng"},{"issue":"3","key":"6572_CR21","doi-asserted-by":"publisher","first-page":"115","DOI":"10.5626\/JCSE.2018.12.3.115","volume":"12","author":"JH Park","year":"2018","unstructured":"Park JH (2018) Paired many-to-many 3-disjoint path covers in bipartite toroidal grids. J Comput Sci Eng 12(3):115\u2013126","journal-title":"J Comput Sci Eng"},{"key":"6572_CR22","doi-asserted-by":"publisher","first-page":"6871","DOI":"10.1007\/s11227-020-03512-7","volume":"77","author":"JH Park","year":"2021","unstructured":"Park JH (2021) A sufficient condition for the unpaired $$k$$-disjoint path coverability of interval graphs. J Supercomput 77:6871\u20136888","journal-title":"J Supercomput"},{"key":"6572_CR23","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.dam.2020.09.008","volume":"289","author":"JH Park","year":"2021","unstructured":"Park JH (2021) Torus-like graphs and their paired many-to-many disjoint path covers. Discrete Appl Math 289:64\u201377","journal-title":"Discrete Appl Math"},{"key":"6572_CR24","doi-asserted-by":"publisher","first-page":"127589","DOI":"10.1109\/ACCESS.2022.3226687","volume":"10","author":"JH Park","year":"2022","unstructured":"Park JH (2022) Unpaired many-to-many disjoint path covers in nonbipartite torus-like graphs with faulty elements. IEEE Access 10:127589\u2013127600","journal-title":"IEEE Access"},{"issue":"4","key":"6572_CR25","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1142\/S0129054122500241","volume":"34","author":"JH Park","year":"2023","unstructured":"Park JH (2023) Paired 3-disjoint path covers in bipartite torus-like graphs with edge faults. Int J Found Comput Sci 34(4):429\u2013441","journal-title":"Int J Found Comput Sci"},{"key":"6572_CR26","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ipl.2018.10.010","volume":"142","author":"JH Park","year":"2019","unstructured":"Park JH, Ihm I (2019) A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph. Inf Process Lett 142:57\u201363","journal-title":"Inf Process Lett"},{"issue":"3","key":"6572_CR27","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1109\/TPDS.2006.37","volume":"17","author":"JH Park","year":"2006","unstructured":"Park JH, Kim HC, Lim HS (2006) Many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements. IEEE Trans Parallel Distrib Syst 17(3):227\u2013240","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"4","key":"6572_CR28","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1109\/TC.2008.160","volume":"58","author":"JH Park","year":"2009","unstructured":"Park JH, Kim HC, Lim HS (2009) Many-to-many disjoint path covers in the presence of faulty elements. IEEE Trans Comput 58(4):528\u2013540","journal-title":"IEEE Trans Comput"},{"issue":"3","key":"6572_CR29","doi-asserted-by":"publisher","first-page":"2783","DOI":"10.1007\/s11227-022-04768-x","volume":"79","author":"JH Park","year":"2023","unstructured":"Park JH, Lim HS (2023) Characterization of interval graphs that are paired 2-disjoint path coverable. J Supercomput 79(3):2783\u20132800","journal-title":"J Supercomput"},{"key":"6572_CR30","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.dam.2023.02.002","volume":"332","author":"E Sabir","year":"2023","unstructured":"Sabir E, Meng J (2023) Degree sequence conditions for a graph to be disjoint path coverable. Discrete Appl Math 332:62\u201369","journal-title":"Discrete Appl Math"},{"key":"6572_CR31","unstructured":"Tsai CH, Tan JM, Chuang YC, Hsu LH (2000) Fault-free cycles and links in faulty recursive circulant graphs. In: Proceedings of Workshop on Algorithms and Theory of Computation ICS, pp 74\u201377"},{"key":"6572_CR32","doi-asserted-by":"publisher","first-page":"5583","DOI":"10.1007\/s11227-019-02817-6","volume":"75","author":"F Wang","year":"2019","unstructured":"Wang F, Zhao W (2019) One-to-one disjoint path covers in hypercubes with faulty edges. J Supercomput 75:5583\u20135595","journal-title":"J Supercomput"},{"key":"6572_CR33","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.tcs.2013.04.002","volume":"491","author":"S Zhang","year":"2013","unstructured":"Zhang S, Wang S (2013) Many-to-many disjoint path covers in $$k$$-ary $$n$$-cubes. Theor Comput Sci 491:103\u2013118","journal-title":"Theor Comput Sci"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06572-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06572-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06572-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T04:05:24Z","timestamp":1729569924000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06572-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,22]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["6572"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06572-1","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,22]]},"assertion":[{"value":"29 August 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares that he has no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"48"}}