no. 6
Cutwidth of the de Bruijn graph
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 29 (1995) no. 6, pp. 509-514. 
@article{ITA_1995__29_6_509_0,
     author = {Raspaud, Andr\'e and S\'ykora, Ondrej and Vrt'o, Imrich},
     title = {Cutwidth of the de {Bruijn} graph},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {509--514},
     publisher = {EDP-Sciences},
     volume = {29},
     number = {6},
     year = {1995},
     mrnumber = {1377028},
     zbl = {0880.05054},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1995__29_6_509_0/}
}
TY  - JOUR
AU  - Raspaud, André
AU  - Sýkora, Ondrej
AU  - Vrt'o, Imrich
TI  - Cutwidth of the de Bruijn graph
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1995
SP  - 509
EP  - 514
VL  - 29
IS  - 6
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1995__29_6_509_0/
LA  - en
ID  - ITA_1995__29_6_509_0
ER  - 
%0 Journal Article
%A Raspaud, André
%A Sýkora, Ondrej
%A Vrt'o, Imrich
%T Cutwidth of the de Bruijn graph
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1995
%P 509-514
%V 29
%N 6
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1995__29_6_509_0/
%G en
%F ITA_1995__29_6_509_0
Raspaud, André; Sýkora, Ondrej; Vrt'o, Imrich. Cutwidth of the de Bruijn graph. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 29 (1995) no. 6, pp. 509-514. http://archive.numdam.org/item/ITA_1995__29_6_509_0/

1. D. Barth, F. Pellegrini, A. Raspaud, and J. Roman, On bandwidth, cutwidth and quotient graphs, RAIRO Informatique, Théorique et Applications, to appear. | Numdam | MR | Zbl

2. A. Bel Hala, Congestion optimale du plongement de l'ypercube H (n) dans la chaine P (2n), RAIRO Informatique, Théorique et Applications, 1993, 27, pp. 1-17. | Numdam | MR | Zbl

3. G. Bilardi and F. Preparata, Area-time lower bound techniques with application to sorting, Algorithmica, 1986, 1, pp. 65-91. | MR | Zbl

4. G. Brebner, Relating routing graphs and two-dimensional grids, in: Proc. VLSI: Algorithms and Architectures, North Holland, 1985. | MR | Zbl

5. D. Kleitman, F. T. Leighton, M. Lepley and G. L. Miller, New layouts for the shuffle-exchange graph, in: Proc. 13th Annual ACM Symposium on Theory of Computing, ACM Press, 1981, pp. 278-292.

6. T. Lengauer, Upper and lower bounds for the min-cut linear arrangements problem on trees, SIAM J. Algebraic and Discrete Methods, 1982, 3, pp. 99-113. | MR | Zbl

7. A. D. Lopez and H. F. S. Law, A dense gate matrix layout method for MOS VLSI, IEEE Trans. Electron. Devices, 1980, 27, pp. 1671-1675.

8. K. Nakano, Linear layout of generalized hypercubes, in: Proc. 19th Intl. Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 790, Springer Verlag, Berlin, 1994, pp. 364-375. | MR

9. C. D. Thompson, Area-time complexity for VLSI, in: Proc. 11th Annual ACM Symposium on Theory of Computing, 1979, pp. 81-88. | MR

10. J. D. Ullman, Computational Aspects of VLSI, Computer Science Press, Rockville, 1984. | Zbl

11. M. Yannakakis, A polynomial algorithm for the Min Cut Linear Arrangement of trees, J. ACM, 1985, 32, pp. 950-988. | MR | Zbl