참고문헌
- E. Cheng and L. Liptak, “Structural properties of hyper-stars,” Ars Combinatoria, Vol.80, pp.65-73, 2006
- E. Cheng and M. Shah, “A strong structural theorem for hyper-stars,” Congressus Numerantium, Vol.179 pp.181-191, 2006
- P. Fragopoulou and S.G. Akl, “Edge-disjoint spanning trees on the star network with applications to fault tolerance,” IEEE Trans. Computers, Vol.45, No.2, pp.174-185, 1996 https://doi.org/10.1109/12.485370
- P. Fraigniaud and C.T. Ho, “Arc-disjoint spanning trees on the cube connected cycles network,” Proc. International Conference on Parallel Processing, Vol.1, pp.225-229, 1991
- S.L. Johnson and C.T. Ho, “Optimal broadcasting and personalized communication in hypercubes,” IEEE Trans. Computers, Vol.38, No.9, pp.1249-1268, 1989 https://doi.org/10.1109/12.29465
- J.-S. Kim, E. Cheng, L. Liptak and H.-O. Lee, “Embedding hypercubes, rings and odd graphs into Hyper-stars,” International Journal of Computer Mathematics, 게재 예정 https://doi.org/10.1080/00207160701691431
- H.-O. Lee, J.-S. Kim, E. Oh, and H.-S. Lim, “Hyper-Star Graph: A New Interconnection Network Improving the Network Cost of the Hypercube,” Lecture Notes in Computer Science : EurAsia-ICT 2002, LNCS 2510, pp. 858-865, 2002 https://doi.org/10.1007/3-540-36087-5_99
- C.-T. Lin, “Embedding k(n-k) edge-disjoint spanning trees in arrangement graphs,” J. Parallel and Distributed Computing, Vol.63, pp.1277-1287, 2003 https://doi.org/10.1016/S0743-7315(03)00107-2
- W. Shi and P.K. Srimani, “One to all broadcast in hyper butterfly networks,” International Conference on High Performance Computing, pp.155-162, 1998 https://doi.org/10.1109/HIPC.1998.737984
- 김종석, 오은숙, 이형옥, “하이퍼-스타 연결망의 위상적 망성질과 방송 알고리즘”, 정보처리학회논문지A, Vol.11-A, No.5, pp.341-346, 2004
- 김종석, 이형옥, “상호연결망 HS(2n,n)의 이분할 에지수와 고장 지름 분석”, 정보처리학회논문지A, Vol.12-A, No.6, pp.499-506, 2005. 12 https://doi.org/10.3745/KIPSTA.2005.12A.6.499
- 김종석, 이형옥, “PMC 모델과 비교진단모델을 이용한 하이퍼-스타 연결망의 진단도 분석”, 정보처리학회논문지A, Vol.13-A, No.1, pp.19-26, 2006. 2 https://doi.org/10.3745/KIPSTA.2006.13A.1.019
피인용 문헌
- Constructing Algorithm of Edge-Disjoint Spanning Trees in Even Interconnection Network Ed vol.17A, pp.3, 2010, https://doi.org/10.3745/KIPSTA.2010.17A.3.113