1 |
F. T. Leighton, Introduction to Parallel Algorithms and Architectures: arrays, trees, hypercubes, Morgan Kaufmann Publishers, San Mateo, California, 1992.
|
2 |
F. R. K. Chung, "On optimal linear arrangment of tree," Comput. Math. Appl. 10, pp.43-60, 1984.
DOI
ScienceOn
|
3 |
H.-S. Lim, On the Labelings of Graphs and their Aplications, Ph.D.Thesis, Dept. Compuetr Science, KAIST, 1993.
|
4 |
KAIST, A Study on the Design and Development of a High-Performance Parallel Compuetr, 1th annual report, 1993.
|
5 |
H.-S.Lim, J.-H.Park, and K.-Y.Chaw, "Embedding trees in recursive circulants," Discrete Applied Mathematics, 69, pp.83-99, 1996.
DOI
ScienceOn
|
6 |
E. Horowitz, S. Sahni, and S. Anderson-Freed Fundamentals of Data Strutures in C. Computer Sience Press, p.493, 1993.
|
7 |
R. L. Graham, D. E. Knuth, and O. Patashnik, "Special numbers," in Concrete Mathmatics. Reading, MA: Adisson-Wesley, 1989, ch.6.
|
8 |
S. N. Bhatt, F. R. K. Chung, F. T. Leighton, and A. L. Rosenberg, "Efficient embeddings of trees in hypercubes," SIAM J. Compt., 21, pp.151-162, 1992.
|
9 |
Y. -S. Kim, M. -G. Roo, "Postorder Fibonacci Circulants," KIPS J., vol,15-A, no.1, pp.27-34, 2008
과학기술학회마을
DOI
|
10 |
Y.-S. Kim, "The Embedding on Postorder Fibonacci Circulant," KIPS J., vol. 14-A, no.4, pp.249-284, 2008.
|
11 |
W.-J. Hsu, "Fibonacci cubes-A new Interconnection Topology," IEEE Transactions on Parallel and Distributed Systems, vol.4, no.1, Jan. 1993.
|
12 |
Y.-S. Kim, "The Researh of Q-ege Labeling on Binomial Trees related to the Graph Embedding," IEEK J. CI. vol.42, Jan. pp,27-34, 2005.
|