{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T07:47:25Z","timestamp":1759132045031},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2015,4,3]],"date-time":"2015-04-03T00:00:00Z","timestamp":1428019200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s11227-015-1417-9","type":"journal-article","created":{"date-parts":[[2015,4,3]],"date-time":"2015-04-03T14:43:20Z","timestamp":1428072200000},"page":"2767-2782","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["2-Disjoint-path-coverable panconnectedness of crossed cubes"],"prefix":"10.1007","volume":"71","author":[{"given":"Hon-Chan","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tzu-Liang","family":"Kung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li-Yen","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,3]]},"reference":[{"key":"1417_CR1","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/0743-7315(91)90113-N","volume":"13","author":"S Abraham","year":"1991","unstructured":"Abraham S, Padmanabhan K (1991) The twisted cube topology for multiprocessors: a study in network asymmetry. J Parallel Distrib Comput 13:104\u2013110","journal-title":"J Parallel Distrib Comput"},{"key":"1417_CR2","first-page":"19","volume":"10","author":"Y Alavi","year":"1975","unstructured":"Alavi Y, Williamson JE (1975) Panconnected graphs. Stud Sci Math Hung 10:19\u201322","journal-title":"Stud Sci Math Hung"},{"key":"1417_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1111\/j.1467-8659.1987.tb00340.x","volume":"6","author":"HR Arabnia","year":"1987","unstructured":"Arabnia HR, Oliver MA (1987) Arbitrary rotation of raster images with SIMD machine architectures. Int J Eurogr Assoc (computer graphics forum) 6:3\u201311","journal-title":"Int J Eurogr Assoc (computer graphics forum)"},{"key":"1417_CR4","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1093\/comjnl\/30.5.425","volume":"30","author":"HR Arabnia","year":"1987","unstructured":"Arabnia HR, Oliver MA (1987) A transputer network for the arbitrary rotation of digitised images. Comput J 30:425\u2013432","journal-title":"Comput J"},{"key":"1417_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1111\/j.1467-8659.1989.tb00448.x","volume":"8","author":"HR Arabnia","year":"1989","unstructured":"Arabnia HR, Oliver MA (1989) A transputer network for fast operations on digitised images. Int J Eurogr Assoc (computer graphics forum) 8:3\u201311","journal-title":"Int J Eurogr Assoc (computer graphics forum)"},{"key":"1417_CR6","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/0743-7315(90)90028-N","volume":"10","author":"HR Arabnia","year":"1990","unstructured":"Arabnia HR (1990) A parallel algorithm for the arbitrary rotation of digitized images using process-and-data-decomposition approach. J Parallel Distrib Comput 10:188\u2013192","journal-title":"J Parallel Distrib Comput"},{"key":"1417_CR7","unstructured":"Arabnia HR, Smith JW (1993) A reconfigurable interconnection network for imaging operations and its implementation using a multi-stage switching box. In: Proceedings of the 7th annual international high performance computing conference. The 1993 high performance computing: new horizons supercomputing symposium, Calgary, pp 349\u2013357"},{"key":"1417_CR8","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF00130109","volume":"10","author":"HR Arabnia","year":"1996","unstructured":"Arabnia HR, Bhandarkar SM (1996) Parallel stereocorrelation on a reconfigurable multi-ring network. J Supercomput 10:243\u2013269","journal-title":"J Supercomput"},{"key":"1417_CR9","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1016\/S0140-3664(96)01104-8","volume":"19","author":"HR Arabnia","year":"1996","unstructured":"Arabnia HR (1996) Distributed stereo-correlation algorithm. Comput Commun 19:707\u2013711","journal-title":"Comput Commun"},{"key":"1417_CR10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1023\/A:1022804606389","volume":"25","author":"M Arif Wani","year":"2003","unstructured":"Arif Wani M, Arabnia HR (2003) Parallel edge-region-based segmentation algorithm targeted at reconfigurable multiring network. J Supercomput 25:43\u201362","journal-title":"J Supercomput"},{"key":"1417_CR11","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1006\/jpdc.1995.1011","volume":"24","author":"SM Bhandarkar","year":"1995","unstructured":"Bhandarkar SM, Arabnia HR (1995) The Hough transform on a reconfigurable multi-ring network. J Parallel Distrib Comput 24:107\u2013114","journal-title":"J Parallel Distrib Comput"},{"key":"1417_CR12","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1142\/S0218001495000110","volume":"9","author":"SM Bhandarkar","year":"1995","unstructured":"Bhandarkar SM, Arabnia HR, Smith JW (1995) A reconfigurable architecture for image processing and computer vision. Int J Pattern Recognit Artif Intell 9:201\u2013229","journal-title":"Int J Pattern Recognit Artif Intell"},{"key":"1417_CR13","doi-asserted-by":"crossref","first-page":"1783","DOI":"10.1016\/0167-8191(95)00032-9","volume":"21","author":"SM Bhandarkar","year":"1995","unstructured":"Bhandarkar SM, Arabnia HR (1995) The REFINE multiprocessor: theoretical properties and algorithms. Parallel Comput 21:1783\u20131805","journal-title":"Parallel Comput"},{"key":"1417_CR14","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":"1417_CR15","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/71.824643","volume":"11","author":"C-P Chang","year":"2000","unstructured":"Chang C-P, Sung T-Y, Hsu L-H (2000) Edge congestion and topological properties of crossed cubes. IEEE Trans Parallel Distrib Syst 11:64\u201380","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"1417_CR16","unstructured":"Chen H-C, Kung T-L (2014) A data verification report on 2-disjoint-path-coverable panconnectedness of crossed cubes. Available at http:\/\/140.128.10.61\/2DPC\/CQn\/index.htm"},{"key":"1417_CR17","doi-asserted-by":"crossref","first-page":"10058","DOI":"10.1016\/j.amc.2011.04.083","volume":"217","author":"H-C Chen","year":"2011","unstructured":"Chen H-C, Kung T-L, Hsu L-H (2011) Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions. Appl Math Comput 217:10058\u201310065","journal-title":"Appl Math Comput"},{"key":"1417_CR18","unstructured":"Chen H-C, Kung T-L, Mao H-W (2012) Fault-tolerant Hamiltonian connectedness of the crossed cube with path faults. In: Proceedings of the international conference on computer science and applied mathematics, pp 297\u2013301"},{"key":"1417_CR19","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1002\/net.10033","volume":"40","author":"SA Choudum","year":"2002","unstructured":"Choudum SA, Sunitha V (2002) Augmented cubes. Networks 40:71\u201384","journal-title":"Networks"},{"key":"1417_CR20","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1109\/71.706050","volume":"9","author":"J Cohen","year":"1998","unstructured":"Cohen J, Fraigniaud P, Konig J-C, Raspaud A (1998) Optimized broadcasting and multicasting protocols in cut-through routed networks. IEEE Trans Parallel Distrib Syst 9:788\u2013802","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"1417_CR21","unstructured":"Cohen J, Fraigniaud P (2000) Broadcasting and multicasting in trees. In: Technical report LRI-1265, Labratorie de Recherche en Informatique, University Paris-Sud, Orsay"},{"key":"1417_CR22","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0167-9236(99)00052-4","volume":"27","author":"A Datta","year":"1999","unstructured":"Datta A, Thomas H (1999) The cube data model: a conceptual model and algebra for on-line analytical processing in data warehouses. Decis Support Syst 27:289\u2013301","journal-title":"Decis Support Syst"},{"key":"1417_CR23","doi-asserted-by":"crossref","first-page":"1312","DOI":"10.1109\/12.102840","volume":"40","author":"K Efe","year":"1991","unstructured":"Efe K (1991) A variation on the hypercube with lower diameter. IEEE Trans Comput 40:1312\u20131316","journal-title":"IEEE Trans Comput"},{"key":"1417_CR24","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1109\/71.159036","volume":"3","author":"K Efe","year":"1992","unstructured":"Efe K (1992) The crossed cube architecture for parallel computing. IEEE Trans Parallel Distribut Syst 3:513\u2013524","journal-title":"IEEE Trans Parallel Distribut Syst"},{"key":"1417_CR25","doi-asserted-by":"crossref","first-page":"3332","DOI":"10.1016\/j.ins.2006.01.001","volume":"176","author":"J Fan","year":"2006","unstructured":"Fan J, Jia X, Lin X (2006) Complete path embeddings in crossed cubes. Inf Sci 176:3332\u20133346","journal-title":"Inf Sci"},{"key":"1417_CR26","doi-asserted-by":"crossref","first-page":"1190","DOI":"10.1109\/TPDS.2005.151","volume":"16","author":"J Fan","year":"2005","unstructured":"Fan J, Lin X, Jia X (2005) Optimal path embeddings in crossed cubes. IEEE Trans Parallel Distrib Syst 16:1190\u20131200","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"1417_CR27","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.ipl.2004.09.026","volume":"93","author":"J Fan","year":"2005","unstructured":"Fan J, Lin X, Jia X (2005) Node-pancyclicity and edge-pancyclicity of crossed cubes. Inf Process Lett 93:133\u2013138","journal-title":"Inf Process Lett"},{"key":"1417_CR28","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1002\/net.10030","volume":"39","author":"M Ghodsi","year":"2002","unstructured":"Ghodsi M, Hajiaghayi MT, Mahdian M, Mirrokni VS (2002) Length-constrained path-matchings in graphs. Networks 39:210\u2013215","journal-title":"Networks"},{"key":"1417_CR29","doi-asserted-by":"crossref","DOI":"10.1201\/9781420044829","volume-title":"Graph theory and interconnection networks","author":"L-H Hsu","year":"2008","unstructured":"Hsu L-H, Lin C-K (2008) Graph theory and interconnection networks. CRC Press, Boca Raton, London, New York"},{"key":"1417_CR30","first-page":"1359","volume":"E85\u2013A","author":"W-T Huang","year":"2002","unstructured":"Huang W-T, Chuang Y-C, Tan JJM, Hsu L-H (2002) On the fault-tolerant Hamiltonicity of faulty crossed cubes. IEICE Trans Fundam E85\u2013A:1359\u20131370","journal-title":"IEICE Trans Fundam"},{"key":"1417_CR31","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0020-0190(97)00012-4","volume":"61","author":"P Kulasinghe","year":"1997","unstructured":"Kulasinghe P (1997) Connectivity of the crossed cube. Inf Process Lett 61:221\u2013226","journal-title":"Inf Process Lett"},{"key":"1417_CR32","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1109\/12.392850","volume":"44","author":"P Kulasinghe","year":"1995","unstructured":"Kulasinghe P, Bettayeb S (1995) Embedding binary trees into crossed cubes. IEEE Trans Comput 44:923\u2013929","journal-title":"IEEE Trans Comput"},{"key":"1417_CR33","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.ipl.2007.12.006","volume":"107","author":"P-L Lai","year":"2008","unstructured":"Lai P-L, Hsu H-C (2008) The two-equal-disjoint path cover problem of matching composition network. Inform Process Lett 107:18\u201323","journal-title":"Inform Process Lett"},{"key":"1417_CR34","volume-title":"Introduction to parallel algorithms and architectures: arrays $$\\cdot $$ \u00b7","author":"FT Leighton","year":"1992","unstructured":"Leighton FT (1992) Introduction to parallel algorithms and architectures: arrays $$\\cdot $$ \u00b7 trees $$\\cdot $$ \u00b7 hypercubes. Morgan Kaufmann, San Mateo"},{"key":"1417_CR35","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.3230200106","volume":"20","author":"S Moran","year":"1990","unstructured":"Moran S, Newman I, Wolfstahl Y (1990) Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight. Networks 20:55\u201364","journal-title":"Networks"},{"key":"1417_CR36","doi-asserted-by":"crossref","first-page":"2036","DOI":"10.1016\/j.ins.2010.12.022","volume":"181","author":"S Nedjar","year":"2011","unstructured":"Nedjar S, Cicchetti R, Lakhal L (2011) Extracting semantics in OLAP database using emerging cubes. Inf Sci 181:2036\u20132059","journal-title":"Inf Sci"},{"key":"1417_CR37","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1109\/TPDS.2006.37","volume":"17","author":"J-H Park","year":"2006","unstructured":"Park J-H, Kim H-C, Lim H-S (2006) Many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements. IEEE Trans Parallel Distrib Syst 17:227\u2013240","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"1417_CR38","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1109\/TC.2008.160","volume":"58","author":"J-H Park","year":"2009","unstructured":"Park J-H, Kim H-C, Lim H-S (2009) Many-to-many disjoint path covers in the presence of faulty elements. IEEE Trans Comput 58:528\u2013540","journal-title":"IEEE Trans Comput"},{"key":"1417_CR39","doi-asserted-by":"crossref","first-page":"169","DOI":"10.14257\/ijmue.2014.9.5.16","volume":"9","author":"NH Park","year":"2014","unstructured":"Park NH, Joo KH (2014) Query processing on OLAP system with cloud computing environment. Int J Multimed Ubiquitous Eng 9:169\u2013174","journal-title":"Int J Multimed Ubiquitous Eng"},{"key":"1417_CR40","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1109\/12.2234","volume":"37","author":"Y Saad","year":"1988","unstructured":"Saad Y, Schultz MH (1988) Topological properties of hypercubes. IEEE Trans Comput 37:867\u2013872","journal-title":"IEEE Trans Comput"},{"key":"1417_CR41","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF01758837","volume":"8","author":"S Wu","year":"1992","unstructured":"Wu S, Manber U (1992) Path-matching problems. Algorithmica 8:89\u2013101","journal-title":"Algorithmica"},{"key":"1417_CR42","volume-title":"Topological structure and analysis of interconnection networks","author":"J-M Xu","year":"2001","unstructured":"Xu J-M (2001) Topological structure and analysis of interconnection networks. Kluwer Academic, Dordrecht"},{"key":"1417_CR43","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1080\/0020716042000301752","volume":"82","author":"X Yang","year":"2005","unstructured":"Yang X, Evans DJ, Megson GM (2005) The locally twisted cubes. Int J Comput Math 82:401\u2013413","journal-title":"Int J Comput Math"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-015-1417-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-015-1417-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-015-1417-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T18:12:53Z","timestamp":1566497573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-015-1417-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,3]]},"references-count":43,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["1417"],"URL":"https:\/\/doi.org\/10.1007\/s11227-015-1417-9","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,3]]}}}