{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T22:13:36Z","timestamp":1781475216388,"version":"3.54.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,5,1]],"date-time":"2017-05-01T00:00:00Z","timestamp":1493596800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s11390-017-1729-8","type":"journal-article","created":{"date-parts":[[2017,5,10]],"date-time":"2017-05-10T05:46:46Z","timestamp":1494395206000},"page":"618-629","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Optimal Path Embedding in the Exchanged Crossed Cube"],"prefix":"10.1007","volume":"32","author":[{"given":"Dong-Fang","family":"Zhou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jian-Xi","family":"Fan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cheng-Kuan","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bao-Lei","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jing-Ya","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,5,12]]},"reference":[{"issue":"5","key":"1729_CR1","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1109\/71.159036","volume":"3","author":"K Efe","year":"1992","unstructured":"Efe K. The crossed cube architecture for parallel computation. IEEE Transactions on Parallel and Distributed Systems, 1992, 3(5): 513-524.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"1","key":"1729_CR2","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/71.824643","volume":"11","author":"CP Chang","year":"2000","unstructured":"Chang C P, Sung T Y, Hsu L H. Edge congestion and topological properties of crossed cubes. IEEE Transactions on Parallel and Distributed Systems, 2000, 11(1): 64-80.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"9","key":"1729_CR3","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1109\/TPDS.2005.113","volume":"16","author":"PKK Loh","year":"2005","unstructured":"Loh P K K, Hsu W J, Pan Y. The exchanged hypercube. IEEE Transactions on Parallel and Distributed Systems, 2005, 16(9): 866-874.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"11","key":"1729_CR4","doi-asserted-by":"crossref","first-page":"2211","DOI":"10.1109\/TPDS.2012.330","volume":"24","author":"KQ Li","year":"2013","unstructured":"Li K Q, Mu Y P, Li K Q, Min G Y. Exchanged crossed cube: A novel interconnection network for parallel computation. IEEE Transactions on Parallel and Distributed Systems, 2013, 24(11): 2211-2219.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"2","key":"1729_CR5","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.ipl.2015.10.003","volume":"116","author":"WT Ning","year":"2016","unstructured":"Ning W T. The super connectivity of exchanged crossed cube. Information Processing Letters, 2016, 116(2): 80-84.","journal-title":"Information Processing Letters"},{"issue":"2","key":"1729_CR6","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/j.ipl.2014.10.017","volume":"115","author":"WT Ning","year":"2015","unstructured":"Ning W T, Feng X L, Wang L. The connectivity of exchanged crossed cube. Information Processing Letters, 2015, 115(2): 394-396.","journal-title":"Information Processing Letters"},{"issue":"4","key":"1729_CR7","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1109\/12.376173","volume":"44","author":"L Auletta","year":"1995","unstructured":"Auletta L, Rescigno A A, Scarano V. Embedding graphs onto the supercube. IEEE Transactions on Computers, 1995, 44(4): 593-597.","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"1729_CR8","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/TC.2004.1255789","volume":"53","author":"HC Hsu","year":"2004","unstructured":"Hsu H C, Li T K, Tan J J, Hsu L H. Fault hamiltonicity and fault hamiltonian connectivity of the arrangement graphs. IEEE Transactions on Computers, 2004, 53(1): 39-53.","journal-title":"IEEE Transactions on Computers"},{"issue":"7","key":"1729_CR9","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1109\/12.392850","volume":"44","author":"P Kulasinghe","year":"1995","unstructured":"Kulasinghe P, Bettayeb S. Embedding binary trees into crossed cubes. IEEE Transactions on Computers, 1995, 44(7): 923-929.","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"1729_CR10","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1109\/12.833112","volume":"49","author":"A Patel","year":"2000","unstructured":"Patel A, Kusalik A, McCrosky C. Area-efficient VLSI layouts for binary hypercubes. IEEE Transactions on Computers, 2000, 49(2): 160-169.","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"1729_CR11","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/71.210815","volume":"4","author":"V Chaudhary","year":"1993","unstructured":"Chaudhary V, Aggarwal J K. A generalized scheme for mapping parallel algorithms. IEEE Transactions on Parallel and Distributed Systems, 1993, 4(3): 328-346.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"12","key":"1729_CR12","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1016\/j.ipl.2015.07.015","volume":"115","author":"D Cheng","year":"2015","unstructured":"Cheng D, Hao R X, Feng Y Q. Embedding even cycles on folded hypercubes with conditional faulty edges. Information Processing Letters, 2015, 115(12): 945-949.","journal-title":"Information Processing Letters"},{"issue":"15","key":"1729_CR13","doi-asserted-by":"crossref","first-page":"3151","DOI":"10.1016\/j.ins.2006.12.010","volume":"177","author":"JX Fan","year":"2007","unstructured":"Fan J X, Jia X H. Embedding meshes into crossed cubes. Information Sciences, 2007, 177(15): 3151-3160.","journal-title":"Information Sciences"},{"issue":"22","key":"1729_CR14","doi-asserted-by":"crossref","first-page":"3332","DOI":"10.1016\/j.ins.2006.01.001","volume":"176","author":"JX Fan","year":"2006","unstructured":"Fan J X, Jia X H, Lin X L. Complete path embeddings in crossed cubes. Information Sciences, 2006, 176(22): 3332-3346.","journal-title":"Information Sciences"},{"issue":"12","key":"1729_CR15","doi-asserted-by":"crossref","first-page":"1190","DOI":"10.1109\/TPDS.2005.151","volume":"16","author":"JX Fan","year":"2005","unstructured":"Fan J X, Lin X L, Jia X H. Optimal path embedding in crossed cubes. IEEE Transactions on Parallel and Distributed Systems, 2005, 16(12): 1190-1200.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"7","key":"1729_CR16","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1016\/j.ins.2005.01.011","volume":"176","author":"JS Fu","year":"2006","unstructured":"Fu J S. Longest fault-free paths in hypercubes with vertex faults. Information Sciences, 2006, 176(7): 759-771.","journal-title":"Information Sciences"},{"issue":"105","key":"1729_CR17","first-page":"231","volume":"105","author":"SS Kao","year":"2012","unstructured":"Kao S S, Lin C K, Huang H M, Hsu L H. Pancyclicity, panconnectivity, and panpositionability for general graphs and bipartite graphs. Ars Combinatoria, 2012, 105(105): 231-246.","journal-title":"Ars Combinatoria"},{"key":"1729_CR18","doi-asserted-by":"crossref","unstructured":"Tsai P Y, Lin Y T. Cycle embedding in alternating group graphs with faulty elements. In Proc. the 8th HumanCom and EMC, Aug. 2013, p.1281.","DOI":"10.1007\/978-94-007-7262-5_145"},{"issue":"4","key":"1729_CR19","first-page":"1347","volume":"31","author":"CH Tsai","year":"2015","unstructured":"Tsai C H, Lai C J. A linear algorithm for embedding of cycles in crossed cubes with edge-pancyclic. Journal of Information Science and Engineering, 2015, 31(4): 1347-1355.","journal-title":"Journal of Information Science and Engineering"},{"issue":"11","key":"1729_CR20","doi-asserted-by":"crossref","first-page":"2117","DOI":"10.1109\/TPDS.2012.30","volume":"23","author":"DJ Wang","year":"2012","unstructured":"Wang D J. Hamiltonian embedding in crossed cubes with failed links. IEEE Transactions on Parallel and Distributed Systems, 2012, 23(11): 2117-2124.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"1729_CR21","doi-asserted-by":"crossref","unstructured":"Andrews M, Chuzhoy J, Guruswami V, Khanna, S, Talwar, K, Zhang L S. Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs. Combinatorica, 2010, 30(5): 485-520.","DOI":"10.1007\/s00493-010-2455-9"},{"issue":"19","key":"1729_CR22","doi-asserted-by":"crossref","first-page":"4200","DOI":"10.1016\/j.ins.2007.02.035","volume":"177","author":"RY Wu","year":"2007","unstructured":"Wu R Y, Chen G H, Kuo Y L, Chang G J. Node-disjoint paths in hierarchical hypercube networks. Information Sciences, 2007, 177(19): 4200-4207.","journal-title":"Information Sciences"},{"issue":"14","key":"1729_CR23","doi-asserted-by":"crossref","first-page":"2487","DOI":"10.1016\/j.ins.2009.02.018","volume":"179","author":"PL Lai","year":"2009","unstructured":"Lai P L, Hsu H C. Constructing the nearly shortest path in crossed cubes. Information Sciences, 2009, 179(14): 2487-2493.","journal-title":"Information Sciences"},{"issue":"6","key":"1729_CR24","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1109\/71.689441","volume":"9","author":"RV Boppana","year":"1998","unstructured":"Boppana R V, Chalasani S, Raghavendra C S. Resource deadlocks and performance of wormhole multicast routing algorithms. IEEE Transactions on Parallel and Distributed Systems, 1998, 9(6): 535-549.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"6","key":"1729_CR25","first-page":"1359","volume":"E85-A","author":"WT Huang","year":"2002","unstructured":"Huang W T, Chuang Y C, Tan J J M et al. On the fault-tolerant hamiltonicity of faulty crossed cubes. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, 2002, E85-A(6): 1359-1370.","journal-title":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences"},{"key":"1729_CR26","first-page":"59","volume":"274","author":"TW Chang","year":"2015","unstructured":"Chang T W, Navr\u00e1til O, Peng S L. The end-to-end longest path problem on a mesh with a missing vertex. Frontiers in Artificial Intelligence and Applications, 2015, 274: 59-66.","journal-title":"Frontiers in Artificial Intelligence and Applications"},{"issue":"2","key":"1729_CR27","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/j.jpdc.2006.04.004","volume":"67","author":"JX Fan","year":"2007","unstructured":"Fan J X, Lin X L, Pan Y, Jia X H. Optimal fault-tolerant embedding of paths in twisted cubes. Journal of Parallel and Distributed Computing, 2007, 67(2): 205-214.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"1729_CR28","doi-asserted-by":"crossref","unstructured":"Hsieh S Y. Embedding longest fault-free paths onto star graphs with more vertex faults. Theoretical Computer Science, 2005, 337(1\/2\/3): 370-378.","DOI":"10.1016\/j.tcs.2005.01.018"},{"issue":"7","key":"1729_CR29","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1109\/TC.2006.104","volume":"55","author":"SY Hsieh","year":"2006","unstructured":"Hsieh S Y, Chang N W. Hamiltonian path embedding and pancyclicity on the M\u00f6bius cube with faulty nodes and faulty edges. IEEE Transactions on Computers, 2006, 55(7): 854-863.","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"1729_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.20290","volume":"54","author":"SY Hsieh","year":"2009","unstructured":"Hsieh S Y, Lin T J. Panconnectivity and edge-pancyclicity of k-ary n-cubes. Networks, 2009, 54(1): 1-11.","journal-title":"Networks"},{"issue":"1","key":"1729_CR31","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/S0252-9602(12)60207-0","volume":"33","author":"M Lin","year":"2013","unstructured":"Lin M, Liu H M. Paths and cycles embedding on faulty enhanced hypercube networks. Acta Mathematica Scientia, 2013, 33(1): 227-246.","journal-title":"Acta Mathematica Scientia"},{"key":"1729_CR32","doi-asserted-by":"crossref","unstructured":"Ma M J, Liu G Z, Xu J M. Fault-tolerant embedding of paths in crossed cubes. Theoretical Computer Science, 2008, 407(1\/2\/3): 110-116.","DOI":"10.1016\/j.tcs.2008.05.002"},{"issue":"3","key":"1729_CR33","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.ipl.2006.08.011","volume":"101","author":"CH Tsai","year":"2007","unstructured":"Tsai C H, Jiang S Y. Path bipancyclicity of hypercubes. Information Processing Letters, 2007, 101(3): 93-97.","journal-title":"Information Processing Letters"},{"issue":"2","key":"1729_CR34","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s11464-009-0017-5","volume":"4","author":"JM Xu","year":"2009","unstructured":"Xu J M, Ma M J. Survey on path and cycle embedding in some networks. Frontiers of Mathematics in China, 2009, 4(2): 217-252.","journal-title":"Frontiers of Mathematics in China"},{"key":"1729_CR35","doi-asserted-by":"crossref","unstructured":"Bondy J A, Murty U S R. Graph Theory with Applications. Citeseer Publisher, 1976.","DOI":"10.1007\/978-1-349-03521-2"},{"issue":"1","key":"1729_CR36","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1142\/S0129054117500058","volume":"28","author":"DF Zhou","year":"2017","unstructured":"Zhou D F, Fan J X, Lin C K, Zhou J Y, Wang X. Cycles embedding in exchanged crossed cube. International Journal of Foundations of Computer Science, 2017, 28(1): 61-76.","journal-title":"International Journal of Foundations of Computer Science"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-017-1729-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-017-1729-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-017-1729-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T03:57:00Z","timestamp":1569297420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-017-1729-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["1729"],"URL":"https:\/\/doi.org\/10.1007\/s11390-017-1729-8","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5]]}}}