Queue layouts of iterated line directed graphs
From MaRDI portal
Publication:885285
DOI10.1016/j.dam.2006.04.045zbMath1117.05046OpenAlexW2049845521MaRDI QIDQ885285
Publication date: 8 June 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2006.04.045
interconnection networksbutterfly directed graphsde Bruijn directed graphsiterated line directed graphsKautz directed graphsqueue layoutthree-dimensional drawing
Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20)
Related Items (4)
An improved upper bound on the queue number of the hypercube ⋮ On the \((h,k)\)-domination numbers of iterated line digraphs ⋮ A new upper bound on the queuenumber of hypercubes ⋮ Upper bounds on the queue number of \(k\)-ary \(n\)-cubes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Containment of butterflies in networks constructed by the line digraph operation
- Hamilton circuits in the directed wrapped Butterfly network
- Line Digraph Iterations and the (d, k) Digraph Problem
- Laying Out Graphs Using Queues
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Maximally connected digraphs
- Stack and Queue Layouts of Directed Acyclic Graphs: Part I
- Stack and Queue Layouts of Directed Acyclic Graphs: Part II
- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
- Graph Drawing
- Layout of Graphs with Bounded Tree-Width
- Sorting Using Networks of Queues and Stacks
This page was built for publication: Queue layouts of iterated line directed graphs