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

DOI10.1016/J.IPL.2009.10.006MaRDI QIDQ990104zbMATHOpenAlexFDO

Authors Kung-Jui Pai, Jou-Ming Chang, 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)

Recommendations

• A new upper bound on the queuenumber of hypercubes
• An improved upper bound on the queue number of the hypercube
• A note on ``An improved upper bound on the queue number of the hypercube
• On the queue-number of the hypercube
• Erratum to: ``A new upper bound on the queuenumber of hypercubes
• Queue layouts of hypercubes
• scientific article; zbMATH DE number 2038749
• An improved upper bound on the queue number of planar graphs
• scientific article; zbMATH DE number 2157327
• Bounds for the crossing number of the N‐cube

Cites work

• scientific article; zbMATH DE number 3492580 (Why is no real title available?)
• scientific article; zbMATH DE number 3596258 (Why is no real title available?)
• scientific article; zbMATH DE number 637336 (Why is no real title available?)
• scientific article; zbMATH DE number 1954397 (Why is no real title available?)
• scientific article; zbMATH DE number 2159644 (Why is no real title available?)
• scientific article; zbMATH DE number 3420624 (Why is no real title available?)
• 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
• Comparing Queues and Stacks As Machines for Laying Out Graphs
• Computing straight-line 3D grid drawings of graphs in linear volume
• Laying Out Graphs Using Queues
• Layout of Graphs with Bounded Tree-Width
• Lee distance and topological properties of k-ary n-cubes
• Queue layouts of graph products and powers
• Queue layouts of iterated line directed graphs
• Sorting Using Networks of Queues and Stacks
• Stack and Queue Layouts of Directed Acyclic Graphs: Part I
• Stack and Queue Layouts of Posets

Cited in

(11)

• An improved upper bound on the queue number of the hypercube
• A note on ``An improved upper bound on the queue number of the hypercube
• On the queue-number of the hypercube
• scientific article; zbMATH DE number 2157327 (Why is no real title available?)
• Queue layouts of hypercubes
• The queue-number of posets of bounded width or height
• Reliability analysis of 3-ary \(n\)-cube in terms of average degree edge-connectivity
• scientific article; zbMATH DE number 1947444 (Why is no real title available?)
• Quaternary \(n\)-cubes and isometric words
• On \(k\)-ary \(n\)-cubes and isometric words
• A new upper bound on the queuenumber of hypercubes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990104)