1 |
S. Gao, B. Novick, and K. Qiu, "From Hall' Matching Theorem to Optimal Routing on Hypercubes," J. Combinatorial Theory, Series B 74, pp. 291-301, 1998.
DOI
ScienceOn
|
2 |
C. Lai, "Two Conditions for Reducing the Maximal Length of Node-Disjoint Paths in Hypercubes,"Theoret. Comput. Sci., Vol. 418, No. 1, pp. 82-91, 2012.
DOI
ScienceOn
|
3 |
C. Chen and J. Chen, "Nearly Optimal One-to- Many Parallel Routing in Star Networks," IEEE Trans. Parall. Distr. Syst., Vol. 8, No. 12, pp. 1196-1202, 1997.
DOI
ScienceOn
|
4 |
Q. Gu and S. Peng, "Cluster Fault-Tolerant Routing in Star Graph,"Networks, Vol. 35, No. 1, pp. 83-90, 2000.
DOI
|
5 |
S. Madhavapeddy and I. Sudborough, "A Topogical Property of Hypercubes: Node Disjoint Paths," IEEE Symp. Parall. Distr. Process., pp. 532- 539, 1997.
|
6 |
H.S. Stone, Discrete Mathematical Structures and Their Applications, SRA, Chicago, IL., 1973.
|
7 |
Y. Chen, S. Promparmote, and F. Maire, "MDSM: Microarray Database Schema Matching using the Hungarian Method," Info. Sci., Vol. 176, No. 19, pp. 2771-2790, 2006.
DOI
ScienceOn
|
8 |
H. Kuhn, "The Hungarian Method for the Assignment Problem,"Naval Res. Logist. Quart., Vol. 2, No. 1-2, pp. 83-97, 1955.
DOI
|
9 |
T. Jeon and C. Kim, "A Real-time Embedded Task Scheduler Considering Falut-tolerant," J. of Korean Multimedia Society, Vol. 12, No. 7, pp. 940-948, 2011
과학기술학회마을
DOI
ScienceOn
|
10 |
J. Park and K. Chwa, "Recursive Circulants and Their Embedding Among Hypercubes," Theoret. Comput. Sci., Vol. 244, No. 1-2, pp. 35-62, 2000.
DOI
ScienceOn
|
11 |
S. Tang, Y. Wang, and C. Yi, "Genneralized recursive circulant graphs," IEEE Trans. Parall. Distr. Syst., Vol. 23, No. 1, pp. 87-93, 2012.
DOI
ScienceOn
|
12 |
J. Park, H. Kim, and H. Lim, "Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements," IEEE Trans. Comput., Vol. 58, No 4, pp. 528-540, 2009.
DOI
ScienceOn
|
13 |
Q. Zhu, J. Xu, and M. Xu, "Reliability of the Folded Hypercubes," Info. Sci., Vol. 177, No. 5, pp. 1782- 1788, 2007.
DOI
ScienceOn
|
14 |
J. Park, "Panconnectivity and Edge-Pancyclicity of Faulty Recursive Circulant G(, 4)," Theoret. Comput. Sci., Vol. 390, No. 1, pp. 70-80, 2008.
DOI
ScienceOn
|
15 |
I. Chung, "Application of the Special Latin Squares to the Parallel Routing Algorithm on Hypercube," J . of Korea Info. Sci. Soc., Vol. 19, No. 5, pp. 569-578, 1992.
|
16 |
Y. Shih and S. Kao, "One-to-one Disjoint Path Covers on K-ary N-cubes," Theoret. Comput. Sci., Vol. 412, No. 1, pp. 4513-4530, 2011.
DOI
ScienceOn
|
17 |
K. Day and A. Tripathi, "A Comparative Study of Topological Properties of Hypercubes and Star Graphs," IEEE Trans. Parall. Distr. Syst., Vol. 5, No. 1, pp. 31-38, 1994.
DOI
ScienceOn
|