1 |
S. Zhang, X. Zhang, "Fault-free Hamiltonian cycles passing through prescribed edges in k-ary n-cubes with faulty edges," IEEE Trans. Parallel and Distributed Systems, vol. 26, pp. 434-443, 2015.
DOI
|
2 |
Yali Lv, Jianxi Fan, D. Frank Hsu, Cheng-Kuan, "Structure connectivity and substructure connectivity of k-ary n-cube networks," Information Sciences, vol. 433, pp. 115-124, 2018.
|
3 |
Y. Chen, S. Promparmote, F. Maire, "MDSM: Microarray database schema matching using the Hungarian method," Information Sciences, vol. 176, pp. 2771-2790, 2006.
DOI
|
4 |
D. Choi, O. Lee, I. Chung, "A parallel routing algorithm on recursive cube of rings networks employing Hamiltonian circuit Latin square," Information Sciences, vol. 178, pp. 1533-154, 2008.1
DOI
|
5 |
I. Chung, "Application of the Special Latin Squares to the Parallel Routing Algorithm on Hypercube," J. of Korea Information Sciences Society, vol. 19, pp. 569-578, 1992.
|
6 |
H. Kuhn, "The Hungarian Method for the Assignment Problem," Naval Res. Logist. Quart., vol. 2, pp. 83-97, 1995.
|
7 |
H.S. Stone, Discrete Mathematical Structures and Their Applications, SRA, Chicago, 1973.
|
8 |
Hee Kyoung Seo, "Development of component architecture to support IoT management," Smart Media Journal, Vol. 6, No. 2, pp.42-49, 2017
|
9 |
Shiying Wang, Weiping Han, "The g-good-neighbor conditional diagnosability of n-dimensional hypercubes under the model," Information Processing Letters, vol. 116, pp. 574-577, 2016.
DOI
|