{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T23:45:00Z","timestamp":1648511100713},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,6,29]],"date-time":"2012-06-29T00:00:00Z","timestamp":1340928000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s10878-012-9528-1","type":"journal-article","created":{"date-parts":[[2012,6,28]],"date-time":"2012-06-28T15:01:34Z","timestamp":1340895694000},"page":"328-344","source":"Crossref","is-referenced-by-count":5,"title":["On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube"],"prefix":"10.1007","volume":"27","author":[{"given":"Tzu-Liang","family":"Kung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng-Kuan","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lih-Hsing","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,6,29]]},"reference":[{"key":"9528_CR1","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1109\/12.21148","volume":"38","author":"SB Akers","year":"1989","unstructured":"Akers SB, Krishnameurthy B (1989) A group-theoretic model for symmetric interconnection networks. IEEE Trans Comput 38:555\u2013566","journal-title":"IEEE Trans Comput"},{"key":"9528_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph theory","author":"JA Bondy","year":"2008","unstructured":"Bondy JA, Murty USR (2008) Graph theory. Springer, London"},{"key":"9528_CR3","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/s10878-008-9205-6","volume":"20","author":"N Casta\u00f1eda","year":"2010","unstructured":"Casta\u00f1eda N, Gotchev IS (2010) Embedded paths and cycles in faulty hypercubes. J Comb Optim 20:224\u2013248","journal-title":"J Comb Optim"},{"key":"9528_CR4","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.ipl.2004.06.006","volume":"92","author":"C-H Chang","year":"2004","unstructured":"Chang C-H, Lin C-K, Huang H-M, Hsu L-H (2004) The super laceability of hypercubes. Inf Process Lett 92:15\u201321","journal-title":"Inf Process Lett"},{"key":"9528_CR5","doi-asserted-by":"crossref","first-page":"3763","DOI":"10.1016\/j.ins.2009.06.029","volume":"179","author":"T Dvo\u0159\u00e1k","year":"2009","unstructured":"Dvo\u0159\u00e1k T, Koubek V (2009) Long paths in hypercubes with a quadratic number of faults. Inf Sci 179:3763\u20133771","journal-title":"Inf Sci"},{"key":"9528_CR6","doi-asserted-by":"crossref","first-page":"3774","DOI":"10.1016\/j.tcs.2010.07.001","volume":"411","author":"T Dvo\u0159\u00e1k","year":"2010","unstructured":"Dvo\u0159\u00e1k T, Koubek V (2010) Computational complexity of long paths and cycles in faulty hypercubes. Theor Comput Sci 411:3774\u20133786","journal-title":"Theor Comput Sci"},{"key":"9528_CR7","author":"J Fink","year":"2011","unstructured":"Fink J, Gregor P (2011) Long cycles in hypercubes with optimal number of faulty vertices. J Comb Optim. doi: 10.1007\/s10878-011-9379-1","journal-title":"J Comb Optim"},{"key":"9528_CR8","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s10878-006-9018-4","volume":"13","author":"S-Y Hsieh","year":"2007","unstructured":"Hsieh S-Y, Yu P-Y (2007) Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges. J Comb Optim 13:153\u2013162","journal-title":"J Comb Optim"},{"key":"9528_CR9","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1109\/12.29465","volume":"38","author":"SL Johnsson","year":"1989","unstructured":"Johnsson SL, Ho C-T (1989) Optimum broadcasting and personalized communication in hypercubes. IEEE Trans Comput 38:1249\u20131268","journal-title":"IEEE Trans Comput"},{"key":"9528_CR10","doi-asserted-by":"crossref","first-page":"1814","DOI":"10.1016\/j.mcm.2008.08.014","volume":"48","author":"T-L Kueng","year":"2008","unstructured":"Kueng T-L, Liang T, Hsu L-H (2008) Mutually independent Hamiltonian cycles of the binary wrapped butterfly networks. Math Comput Model 48:1814\u20131825","journal-title":"Math Comput Model"},{"key":"9528_CR11","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/s10878-007-9113-1","volume":"17","author":"T-L Kueng","year":"2009","unstructured":"Kueng T-L, Lin C-K, Liang T, Tan JJM, Hsu L-H (2009a) A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges. J Comb Optim 17:312\u2013322","journal-title":"J Comb Optim"},{"key":"9528_CR12","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/j.parco.2009.06.002","volume":"35","author":"T-L Kueng","year":"2009","unstructured":"Kueng T-L, Lin C-K, Liang T, Tan JJM, Hsu L-H (2009b) Embedding paths of variable lengths into hypercubes with conditional link-faults. Parallel Comput 35:441\u2013454","journal-title":"Parallel Comput"},{"key":"9528_CR13","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1016\/j.tcs.2008.11.004","volume":"410","author":"T-L Kung","year":"2009","unstructured":"Kung T-L, Lin C-K, Liang T, Hsu L-H, Tan JJM (2009) On the bipanpositionable bipanconnectedness of hypercubes. Theor Comput Sci 410:801\u2013811","journal-title":"Theor Comput Sci"},{"key":"9528_CR14","first-page":"734","volume":"88","author":"T-L Kung","year":"2011","unstructured":"Kung T-L, Lin C-K, Liang T, Tan JJM, Hsu L-H (2011) Fault-free mutually independent Hamiltonian cycles of faulty star graphs. Int J Comput Math 88:734\u2013746","journal-title":"Int J Comput Math"},{"key":"9528_CR15","unstructured":"Kung T-L (2012) http:\/\/www.cs.nctu.edu.tw\/~tlkueng\/DATA\/JOCO\/Lemma4Base(Mod).pdf"},{"key":"9528_CR16","volume-title":"Introduction to parallel algorithms and architectures: arrays \u22c5 trees \u22c5 hypercubes","author":"FT Leighton","year":"1992","unstructured":"Leighton FT (1992) Introduction to parallel algorithms and architectures: arrays \u22c5 trees \u22c5 hypercubes. Morgan Kaufmann, San Mateo"},{"key":"9528_CR17","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1109\/12.743414","volume":"48","author":"Y Leu","year":"1999","unstructured":"Leu Y, Kuo S (1999) Distributed fault-tolerant ring embedding and reconfiguration in hypercubes. IEEE Trans Comput 48:81\u201388","journal-title":"IEEE Trans Comput"},{"key":"9528_CR18","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0898-1221(97)00223-X","volume":"34","author":"M Lewinter","year":"1997","unstructured":"Lewinter M, Widulski W (1997) Hyper-hamilton laceable and caterpillar-spannable product graphs. Comput Math Appl 34:99\u2013104","journal-title":"Comput Math Appl"},{"key":"9528_CR19","first-page":"137","volume":"106","author":"C-K Lin","year":"2012","unstructured":"Lin C-K, Shih Y-K, Tan JJM, Hsu L-H (2012) Mutually independent Hamiltonian cycles in some graphs. Ars Combin 106:137\u2013142","journal-title":"Ars Combin"},{"key":"9528_CR20","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1109\/12.2234","volume":"37","author":"Y Saad","year":"1988","unstructured":"Saad Y, Shultz MH (1988) Topological properties of hypercubes. IEEE Trans Comput 37:867\u2013872","journal-title":"IEEE Trans Comput"},{"key":"9528_CR21","doi-asserted-by":"crossref","first-page":"2212","DOI":"10.1080\/00207160802512700","volume":"87","author":"Y-K Shih","year":"2010","unstructured":"Shih Y-K, Lin C-K, Hsu DF, Tan JJM, Hsu L-H (2010a) The construction of mutually independent Hamiltonian cycles in bubble-sort graphs. Int J Comput Math 87:2212\u20132225","journal-title":"Int J Comput Math"},{"key":"9528_CR22","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s11227-009-0317-2","volume":"54","author":"Y-K Shih","year":"2010","unstructured":"Shih Y-K, Chuang H-C, Kao S-S, Tan JJM (2010b) Mutually independent Hamiltonian cycles in dual-cube. J Supercomput 54:239\u2013251","journal-title":"J Supercomput"},{"key":"9528_CR23","first-page":"103","volume":"21","author":"G Simmons","year":"1978","unstructured":"Simmons G (1978) Almost all n-dimensional rectangular lattices are hamilton laceable. Congr Numer 21:103\u2013108","journal-title":"Congr Numer"},{"key":"9528_CR24","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/j.compeleceng.2011.01.008","volume":"37","author":"H Su","year":"2011","unstructured":"Su H, Pan J-L, Kao S-S (2011a) Mutually independent Hamiltonian cycles in k-ary n-cubes when k is even. Comput Electr Eng 37:319\u2013331","journal-title":"Comput Electr Eng"},{"key":"9528_CR25","doi-asserted-by":"crossref","unstructured":"Su H, Chen S-Y, Kao S-S (2011b) Mutually independent Hamiltonian cycles in alternating group graphs. J Supercomput. doi: 10.1007\/s11227-011-0614-4","DOI":"10.1007\/s11227-011-0614-4"},{"key":"9528_CR26","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1142\/S0219265906001697","volume":"7","author":"C-M Sun","year":"2006","unstructured":"Sun C-M, Lin C-K, Huang H-M, Hsu L-H (2006) Mutually independent Hamiltonian paths and cycles in hypercubes. J Interconnect Netw 7:235\u2013255","journal-title":"J Interconnect Netw"},{"key":"9528_CR27","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0020-0190(02)00214-4","volume":"83","author":"C-H Tsai","year":"2002","unstructured":"Tsai C-H, Tan JJM, Linag T, Hsu L-H (2002) Fault-tolerant Hamiltonian laceability of hypercubes. Inf Process Lett 83:301\u2013306","journal-title":"Inf Process Lett"},{"key":"9528_CR28","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1109\/12.280808","volume":"43","author":"P-J Yang","year":"1994","unstructured":"Yang P-J, Tien S-B, Raghavendra CS (1994) Embedding of rings and meshes onto faulty hypercubes using free dimensions. IEEE Trans Comput 43:608\u2013613","journal-title":"IEEE Trans Comput"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9528-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9528-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9528-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:19Z","timestamp":1559276599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9528-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,29]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["9528"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9528-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,29]]}}}