Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Hamilton circuits in the directed wrapped Butterfly network
Discrete Applied Mathematics
A note on 3D orthogonal graph drawing
Discrete Applied Mathematics
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks
| Hi-index | 0.00 |
In this paper, we show that for any fixed d-regular digraph G, every iterated line digraph Lk(G)(k ≥ 1) can be embedded in d layers using O(n2) area, where n is the number of vertices in Lk(G). Also, we present Ω(n2/log2n) lower bound on the area of Lk(G) for any fixed number of layers. Besides, we apply the results to specific families of iterated line digraphs such as de Bruijn digraphs, Kautz digraphs, and wrapped butterfly digraphs.