An improved upper bound on the queue number of the hypercube

DOI10.1016/J.IPL.2007.05.006MaRDI QIDQ2379994zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Toru Hasunuma, Misa Hirota

Publication date 24 March 2010

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

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

zbMATH Keywords

hypercubeinterconnection networkscombinatorial problemsqueue layout

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68M99)

Recommendations

• A new upper bound on the queuenumber of hypercubes
• Queue layouts of hypercubes
• On the queue-number of the hypercube
• Upper bounds on the queue number of \(k\)-ary \(n\)-cubes
• Erratum to: ``A new upper bound on the queuenumber of hypercubes

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• Laying Out Graphs Using Queues
• Layout of Graphs with Bounded Tree-Width
• Queue layouts of graph products and powers
• Queue layouts of iterated line directed graphs

Cited in

(6)

• A new upper bound on the queuenumber of hypercubes
• A note on ``An improved upper bound on the queue number of the hypercube
• Upper bounds on the queue number of \(k\)-ary \(n\)-cubes
• Erratum to: ``A new upper bound on the queuenumber of hypercubes
• Queue layouts of hypercubes
• On the queue-number of the hypercube

This page was built for publication: An improved upper bound on the queue number of the hypercube

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