Bisecting de Bruijn and Kautz graphs

Discrete Applied Mathematics

Volumn 85, Issue 1, 1998, Pages 87-97

  Rolim, José ^a   Tvrdík, Pavel ^b   Trdlička, Jan ^b   Vrto, Imrich ^c  

^a UNIVERSITY OF GENEVA   (Switzerland)

^b CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

^c INSTITUTE OF CHEMISTRY   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0006966083     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00031-6     Document Type: Article

References (22)

1. T. Andreae, M. Nölle, G. Schreiber, Cartesian products of graphs as spanning subgraphs of de Bruijn graphs, in: Proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, vol. 903, Springer, Berlin, 1995, pp. 140-150.
2. D. Barth, F. Pellegrini, A. Raspaud, J. Roman, On bandwidth, cutwidth and quotient graphs, RAIRO -Informatique, Théor. Appl. 29 (1996) 487-508.
3. J.-C. Bermond, C. Peyrat, De Bruijn and Kautz networks: a competitor for the hypercube?, in: Proceedings of the Hypercube and Distributed Computing, Elsevier, Amsterdam, 1989, pp. 279-274.
4. N.G. de Bruijn, A combinatorial problem, Neder. Akad. Wetensch. Proc. Ser. A 49 (1946) 758-764.
5. F.R.K. Chung, E.G. Coffman, M.I. Reiman, B.E. Simon, The forwarding index of communication networks, IEEE Trans. Inform. Theory 33 (1987) 224-232.
6. R. Feldmann, B. Monien, P. Mysliwietz, S. Tschöke, a better upper bound on the bisection width of de Bruijn networks, in: Proceedings of the 14th International Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 1200, Springer, Berlin, 1997 pp. 511-522.
7. M.-C. Heydemann, J.C. Meyer, D. Sotteau, On forwarding indices of networks, Discrete Appl. Math. 23 (1989) 103-123.
8. D. Hoey, Ch.E. Leiserson, A layout for the shuffle-exchange graph, in: Proceedings of the International Conference on Parallel Processing, IEEE Computer Society Press, Los Alamitos, CA, 1980, pp. 329-336.
9. J. Hromković, B. Monien, The bisection problem for graphs of degree 4, in: Proceedings of the 16th International Symposium on Foundations of Computer Science, Lecture Notes in Computer Science, vol. 520 Springer, Berlin, 1991, pp. 211-220.
10. R. Klasing, The relationship between gossiping in vertex-disjoint paths mode and bisection width, in: Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science vol. 841, Springer, Berlin, 1994, pp. 473-483.
11. M. Kunde, Concentrated data stream on grids: Sorting and routing near to the bisection bound, in: Proceedings of the 32nd Annual IEEE Symposium on Foundation of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1991 pp. 141-150.
12. F.T. Leighton, Complexity Issues in VLSI, MIT Press, Cambridge, 1983.
13. F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, and Hypercubes, Morgan Kaufmann Publishers, San Mateo, 1992.
14. R.J. Lipton, R.E. Tarjan, Application of planar separator theorem, SIAM J. Comput. 9 (1980) 615-627.
15. B. Monien, R. Diekmann, R. Lülling, Communication throughput of interconnection networks, in: Proc. 19th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science vol. 841, Springer, Berlin, 1994 pp. 72-86.
16. F. Pellegrini, Bounds for the bandwidth of the d-ary de Bruijn graph, Parallel Process. Lett. 3 (1993) 431-443.
17. M.R. Samatham, D.K. Pradhan, The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI, IEEE Trans. Comput. 38 (1989) 567-581.
18. I.R. Shafarevich, Z. Borevich, Theory of Numbers, Nauka, Moscow, 1967.
19. W. Sierpiński, Elementary Theory of Numbers, Państwowe Wydawnictwo Naukowe, Warszawa, 1964.
20. C.D. Thompson, Area-time complexity for VLSI, in: Proceedings of the 11th Annual Symposium on Theory of Computing, ACM Press, New York, 1979 pp. 81-88.
21. P. Tvrdík, Necklaces, scalability of Kautz digraphs, in: Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, IEEE Computer Society Press, Los Alamitos, CA 1994, pp. 409-415.
22. J.D. Ullman, Computational Aspects of VLSI, Computer Science Press, Rockville, 1984.