Upper bounds on the queue number of k-ary n-cubes
DOI10.1016/J.IPL.2009.10.006zbMATH Open1197.05099OpenAlexW2023847815MaRDI QIDQ990104FDOQ990104
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
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
hypercubecombinatorial problems\(k\)-ary \(n\)-cubesqueue numberqueue layoutarched leveled-planar graphsternary \(n\)-cubes
Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Lee distance and topological properties of k-ary n-cubes
- Laying Out Graphs Using Queues
- Layout of Graphs with Bounded Tree-Width
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sorting Using Networks of Queues and Stacks
- Title not available (Why is that?)
- Stack and Queue Layouts of Directed Acyclic Graphs: Part I
- Queue layouts of iterated line directed graphs
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Stack and Queue Layouts of Posets
- Title not available (Why is that?)
- Computing straight-line 3D grid drawings of graphs in linear volume
- Title not available (Why is that?)
- An improved upper bound on the queue number of the hypercube
- A new upper bound on the queuenumber of hypercubes
- A note on ``An improved upper bound on the queue number of the hypercube
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- The queue-number of posets of bounded width or height
- A new upper bound on the queuenumber of hypercubes
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the queue-number of the hypercube
- Reliability analysis of 3-ary \(n\)-cube in terms of average degree edge-connectivity
- Quaternary \(n\)-cubes and isometric words
- On \(k\)-ary \(n\)-cubes and isometric words
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)
