Upper bounds on the queue number of \(k\)-ary \(n\)-cubes

DOI10.1016/J.IPL.2009.10.006zbMath1197.05099OpenAlexW2023847815MaRDI QIDQ990104

Jou-Ming Chang, Kung-Jui Pai, Yue-Li Wang

Publication date: 2 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.10.006

zbMATH Keywords

hypercubecombinatorial problems\(k\)-ary \(n\)-cubesqueue numberqueue layoutarched leveled-planar graphsternary \(n\)-cubes

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (4)

Quaternary \(n\)-cubes and isometric words ⋮ Reliability analysis of 3-ary \(n\)-cube in terms of average degree edge-connectivity ⋮ Unnamed Item ⋮ On \(k\)-ary \(n\)-cubes and isometric words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Queue layouts of iterated line directed graphs
• A new upper bound on the queuenumber of hypercubes
• A note on ``An improved upper bound on the queue number of the hypercube
• An improved upper bound on the queue number of the hypercube
• Computing straight-line 3D grid drawings of graphs in linear volume
• Laying Out Graphs Using Queues
• Comparing Queues and Stacks As Machines for Laying Out Graphs
• Stack and Queue Layouts of Directed Acyclic Graphs: Part I
• Stack and Queue Layouts of Posets
• Lee distance and topological properties of k-ary n-cubes
• Layout of Graphs with Bounded Tree-Width
• Sorting Using Networks of Queues and Stacks

This page was built for publication: Upper bounds on the queue number of \(k\)-ary \(n\)-cubes