Title of article
Queue layouts of iterated line directed graphs Original Research Article
Author/Authors
Toru Hasunuma، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
14
From page
1141
To page
1154
Abstract
In this paper, we study queue layouts of iterated line directed graphs. A k-queue layout of a directed graph consists of a linear ordering of the vertices and an assignment of each arc to exactly one of the k queues so that any two arcs assigned to the same queue do not nest. The queuenumber of a directed graph is the minimum number of queues required for a queue layout of the directed graph.
Keywords
Queue layout , interconnection networks , de Bruijn directed graphs , Kautz directed graphs , Butterfly directed graphs , Three-dimensional drawing , Iterated line directed graphs
Journal title
Discrete Applied Mathematics
Serial Year
2007
Journal title
Discrete Applied Mathematics
Record number
886493
Link To Document