Multilayer grid embeddings of iterated line digraphs

Authors:
Toru Hasunuma
Affiliations:
The University of Tokushima, Minamijosanjima, Tokushima, Japan
Venue:
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
Year:
2006

Citing 5
Cited 0

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
Three-Dimensional Orthogonal Graph Drawing with Optimal Volume

Algorithmica
Line Digraph Iterations and the (d, k) Digraph Problem

IEEE Transactions on Computers
Topological Structure and Analysis of Interconnection Networks

Topological Structure and Analysis of Interconnection Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 [EQUATION] 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.