{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T13:13:06Z","timestamp":1694610786464},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,1,5]],"date-time":"2011-01-05T00:00:00Z","timestamp":1294185600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s11227-010-0538-4","type":"journal-article","created":{"date-parts":[[2011,1,4]],"date-time":"2011-01-04T08:47:11Z","timestamp":1294130831000},"page":"1336-1347","source":"Crossref","is-referenced-by-count":5,"title":["Topological properties of folded hyper-star networks"],"prefix":"10.1007","volume":"59","author":[{"given":"Jong-Seok","family":"Kim","sequence":"first","affiliation":[]},{"given":"Sung Won","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Eddie","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"L\u00e1szl\u00f3","family":"Lipt\u00e1k","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,1,5]]},"reference":[{"key":"538_CR1","first-page":"393","volume-title":"Proceedings of the 1987 international conference on parallel processing","author":"SB Akers","year":"1987","unstructured":"Akers SB, Harel D, Krishnamurthy B (1987) The star graph: an attractive alternative to the n-cube. In: Proceedings of the 1987 international conference on parallel processing, pp 393\u2013400"},{"key":"538_CR2","first-page":"349","volume-title":"Proceedings of the 7th annual international high performance computing conference. The 1993 high performance computing: new horizons supercomputing symposium","author":"HR Arabnia","year":"1993","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, Alberta, Canada, pp 349\u2013357"},{"issue":"5","key":"538_CR3","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(5):425\u2013433","journal-title":"Comput J"},{"key":"538_CR4","doi-asserted-by":"crossref","first-page":"1671","DOI":"10.1016\/j.ins.2010.01.016","volume":"180","author":"E Cheng","year":"2010","unstructured":"Cheng E, Grossman JW, Lipt\u00e1k L, Qiu K, Shen Z (2010) Distance formula and shortest paths of the (n,k)-star graphs. Inf Sci 180:1671\u20131680","journal-title":"Inf Sci"},{"key":"538_CR5","first-page":"65","volume":"80","author":"E Cheng","year":"2006","unstructured":"Cheng E, Lipt\u00e1k L (2006) Structural properties of hyper-stars. Ars Comb 80:65\u201373","journal-title":"Ars Comb"},{"key":"538_CR6","first-page":"181","volume":"179","author":"E Cheng","year":"2006","unstructured":"Cheng E, Shah M (2006) A strong structural theorem for hyper-stars. Congr Numer 179:181\u2013191","journal-title":"Congr Numer"},{"issue":"52","key":"538_CR7","doi-asserted-by":"crossref","first-page":"5481","DOI":"10.1016\/j.tcs.2009.05.007","volume":"410","author":"E Cheng","year":"2009","unstructured":"Cheng E, Shen Z, Qiu K (2009) On the surface area of the (n,k)-star graph. Theor Comput Sci 410(52):5481\u20135490","journal-title":"Theor Comput Sci"},{"issue":"3","key":"538_CR8","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1006\/jpdc.1994.1158","volume":"23","author":"DR Duh","year":"1994","unstructured":"Duh DR, Chen GH (1994) Topological properties of WK-recursive networks. J Parallel Distrib Comput 23(3):468\u2013474","journal-title":"J Parallel Distrib Comput"},{"issue":"1","key":"538_CR9","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/71.80187","volume":"2","author":"A El-Amawy","year":"1991","unstructured":"El-Amawy A, Latifi S (1991) Properties and performance of folded hypercubes. IEEE Trans Parallel Distrib Syst 2(1):31\u201342","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"7","key":"538_CR10","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1016\/j.ins.2005.01.011","volume":"176","author":"JS Fu","year":"2006","unstructured":"Fu JS (2006) Longest fault-free paths in hypercubes with vertex faults. Inf Sci 176(7):759\u2013771","journal-title":"Inf Sci"},{"issue":"6","key":"538_CR11","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1006\/jpdc.2000.1632","volume":"60","author":"QP Gu","year":"2000","unstructured":"Gu QP, Peng ST (2000) An efficient algorithm for the k-pairwise disjoint paths problem in hypercubes. J Parallel Distrib Comput 60(6):764\u2013774","journal-title":"J Parallel Distrib Comput"},{"issue":"4","key":"538_CR12","first-page":"1450","volume":"E77-A","author":"DF Hsu","year":"1994","unstructured":"Hsu DF (1994) On container width and length in graphs, groups, and networks. IEICE Trans Fundam Electron Commun Comput Sci E77-A(4):1450\u20131466","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"issue":"9","key":"538_CR13","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1109\/12.29465","volume":"38","author":"SL Johnson","year":"1989","unstructured":"Johnson SL, Ho CT (1989) Optimal broadcasting and personalized communication in hypercubes. IEEE Trans Comput 38(9):1249\u20131268","journal-title":"IEEE Trans Comput"},{"key":"538_CR14","series-title":"LNCS","first-page":"51","volume-title":"Proceedings of the 18th international symposium on computer and information sciences","author":"J-S Kim","year":"2003","unstructured":"Kim J-S, Oh E, Lee H-O, Heo Y-N (2003) Topological and communication aspects of hyper-star graphs. In: Proceedings of the 18th international symposium on computer and information sciences. LNCS, vol 2869, pp 51\u201358"},{"issue":"5","key":"538_CR15","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1080\/00207160701691431","volume":"86","author":"J-S Kim","year":"2009","unstructured":"Kim J-S, Cheng E, Lipt\u00e1k L, Lee H-O (2009) Embedding hypercubes, rings and odd graphs into hyper-stars. Int J Comput Math 86(5):771\u2013778","journal-title":"Int J Comput Math"},{"issue":"1\u20133","key":"538_CR16","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.tcs.2005.02.010","volume":"341","author":"CN Lai","year":"2005","unstructured":"Lai CN, Chen GH (2005) Strong Rabin numbers of folded hypercubes. Theor Comput Sci 341(1\u20133):196\u2013215","journal-title":"Theor Comput Sci"},{"key":"538_CR17","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1007\/3-540-36087-5_99","volume-title":"Proceedings of EurAsia ICT: information and communication technology","author":"H-O Lee","year":"2002","unstructured":"Lee H-O, Kim J-S, Oh E, Lim H-S (2002) Hyper-star graph: a new interconnection network improving the network cost of hypercube. In: Proceedings of EurAsia ICT: information and communication technology. LNCS, vol 2510, pp 858\u2013865"},{"key":"538_CR18","volume-title":"Introduction to parallel algorithms and architectures: arrays, trees, hypercubes","author":"T Leighton","year":"1992","unstructured":"Leighton T (1992) Introduction to parallel algorithms and architectures: arrays, trees, hypercubes. Morgan Kaufman, San Mateo"},{"key":"538_CR19","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1016\/j.ins.2007.09.014","volume":"178","author":"T-C Lin","year":"2008","unstructured":"Lin T-C, Duh D-R (2008) Constructing vertex-disjoint paths in (n,k)-star graphs. Inf Sci 178:788\u2013801","journal-title":"Inf Sci"},{"issue":"2","key":"538_CR20","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1145\/62044.62050","volume":"36","author":"MO Rabin","year":"1989","unstructured":"Rabin MO (1989) Efficient dispersal of information for security, load balancing, and fault tolerance. J ACM 36(2):335\u2013348","journal-title":"J ACM"},{"issue":"7","key":"538_CR21","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(7):867\u2013872","journal-title":"IEEE Trans Comput"},{"issue":"13","key":"538_CR22","doi-asserted-by":"crossref","first-page":"2571","DOI":"10.1016\/j.ins.2010.03.002","volume":"180","author":"D Walker","year":"2010","unstructured":"Walker D, Latifi S (2010) Improving bounds on link failure tolerance of the star graph. Inf Sci 180(13):2571\u20132575","journal-title":"Inf Sci"},{"issue":"8","key":"538_CR23","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1016\/j.aml.2005.09.004","volume":"19","author":"L Wang","year":"2006","unstructured":"Wang L, Subramanian S, Latifi S, Srimani PK (2006) Distance distribution of nodes in star graphs. Appl Math Lett 19(8):780\u2013784","journal-title":"Appl Math Lett"},{"key":"538_CR24","doi-asserted-by":"crossref","first-page":"4200","DOI":"10.1016\/j.ins.2007.02.035","volume":"177","author":"R-Y Wu","year":"2007","unstructured":"Wu R-Y, Chen G-H, Kuo Y-L, Chang GJ (2007) Node-disjoint paths in hierarchical hypercube networks. Inf Sci 177:4200\u20134207","journal-title":"Inf Sci"},{"issue":"1","key":"538_CR25","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1142\/S0129626410000077","volume":"20","author":"SS Yasim","year":"2010","unstructured":"Yasim SS, Latifi S (2010) Optimal subcube embeddability in hypercubes with additional dimensions. Parallel Process Lett 20(1):91\u201399","journal-title":"Parallel Process Lett"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-010-0538-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-010-0538-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-010-0538-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:24:03Z","timestamp":1559384643000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-010-0538-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,5]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["538"],"URL":"https:\/\/doi.org\/10.1007\/s11227-010-0538-4","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,5]]}}}