Multidimensional linear congruential graphs
Koung, C. C. ; Opatrny, J.
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 28 (1994), p. 187-199 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1994-01-01
@article{ITA_1994__28_3-4_187_0,
     author = {Koung, C. C. and Opatrny, J.},
     title = {Multidimensional linear congruential graphs},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {28},
     year = {1994},
     pages = {187-199},
     mrnumber = {1282444},
     zbl = {0883.68101},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1994__28_3-4_187_0}
}

Koung, C. C.; Opatrny, J. Multidimensional linear congruential graphs. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 28 (1994) pp. 187-199. http://gdmltest.u-ga.fr/item/ITA_1994__28_3-4_187_0/

1. J. C. Bermond, C. Delorme and J. J. Quisquater, Strategies for interconnection networks: some methods from graph theory, Journal of Parallel and Distributed Computing, 1986, 3, pp. 433-449.

2. J. C. Bermond, C. Peyrat, de BRUIJN and KAUTZ networks: a competitor for the hypercube? Hypercube and Distributed Computers, 1989, pp. 279-294.

3. J. A. Bondy and U. S. R. Murty, Graphs Theory with Applications, North Holland, 1976.

4. F. R. K. Chung, Diameters of graphs: old problems and new results, Proceedings of the 18th South-Eastern Conference on Combinatorics, Graph Theory, and Computing, Congressus Numerantium, 1987, pp. 295-317. | MR 945240 | Zbl 0695.05029

5. C. Delorme, A Table of Large Graphs of Small Degrees and Diameters, personal communication, 1990.

6. D. Z. Du and F. K. Hwang, Generalized de Bruijn Digraphs, Networks, 1988, 18, pp. 28-38. | MR 926031 | Zbl 0654.05036

7. B. Elpas, Topological Constrains on Interconnection Limited Logic, Switching Circuits Theory and Logical Design, 1964, 5, pp. 133-147.

8. M. Imase and M. Itoh, Design to minimize diameter on building block network, IEEE Trans. on Computers, 1981, C-30, pp. 439-442. | MR 626733 | Zbl 0456.94030

9. W. H. Kautz, Bounds on directed (d, k) graphs, Theory of Cellular Logic Networks and Machines, SRI Project 7258, 1968, pp. 20-28.

10. D. E. Knuth, The art of computer programming, Seminumerical Algorithms, Addison-Wesley, II, 1972. | MR 378456

11. C. C. Koung, Multi-dimensional Linear Congruential Network Models, Master's Thesis, Dept. of Comp. Sci. Concordia University, Montreal, 1993.

12. W. Leland and M. Solomon, Dense trivalent graphs for processor interconnection, IEEE Trans, on Computers, 1982, 31, No. 3, pp. 219-222. | MR 648372 | Zbl 0477.68068

13. J. Opatrny and D. Sotteau, Linear Congruential Graphs, Graph Theory, Combinatorics, Algorithms, and Applications, SIAM proceedings series, 1991, pp. 404-426. | MR 1132923 | Zbl 0739.05074

14. J. Opatrny, D. Sotteau, N. Srinivasan and K. Thulasiraman, DCC Linear Congruential Graphs, a New Network Model, IEEE Trans. Comput., to appear. | MR 1376915

15. M. R. Samantham and D. K. Pradham, The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI, IEEE Trans. Cornput., 1989,38, No. 4, pp. 567-581. | MR 984681 | Zbl 0671.94028