Embedding de Bruijn and Shuffle-Exchange Graphs in Five Pages (Preliminary Version)

We present algorithms for embedding de shuffle-exchange graphs in books of 5 pages lative pagewidth 2“ – 1 + (2/3) (2”-1 – 2 + Bruijn and with cumu(n mod 2)) .,. and 27’-1 + (1/3) (27’-1 — 2 + (n mod 2)), respectively. The book-embedding problem abstracts layout problems encountered in designing fault-tolerant VLSI processor arrays; the pagenumber models… CONTINUE READING