Upper bounds on the queuenumber of k-ary n-cubes☆
References (26)
- et al.
Scheduling tree-dags using FIFO queues: A control-memory tradeoff
J. Parallel Distrib. Comput.
(1996) - et al.
Queues, stacks, and graphs
- et al.
Computing straightline 3D grid drawings of graphs in linear volume
Comput. Geom.
(2005) Queue layouts of iterated line directed graphs
Discrete Appl. Math.
(2007)- et al.
An improved upper bound on the queuenumber of the hypercube
Inform. Process. Lett.
(2007) - et al.
A note on “An improved upper bound on the queuenumber of the hypercube”
Inform. Process. Lett.
(2008) - et al.
Lee distance and topological properties of k-ary n-cubes
IEEE Trans. Comput.
(1995) Performance analysis of k-ary n-cube interconnection networks
IEEE Trans. Comput.
(1990)- et al.
Fault diameter of k-ary n-cube networks
IEEE Trans. Parallel Distributed Syst.
(1997) - et al.
Layout of graphs with bounded tree-width
SIAM J. Comput.
(2005)
On linear layouts of graphs
Discrete Math. Theor. Comput. Sci.
(2004)
Comparing queues and stacks as mechanisms for laying out graphs
SIAM J. Discrete Math.
(1992)
Cited by (7)
Reliability analysis of 3-ary n-cube in terms of average degree edge-connectivity
2023, Discrete Applied MathematicsOn k-ary n-cubes and isometric words
2022, Theoretical Computer ScienceOn the queue-number of the hypercube
2011, Electronic Notes in Discrete MathematicsQuaternary n-cubes and Isometric Words
2021, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Queue layouts of toroidal grids
2014, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- ☆
This research was partially supported by National Science Council of Taiwan under contracts NSC-97-2221-E260-007-MY3 and NSC97-2115-M-141-001-MY2.
Copyright © 2009 Elsevier B.V. All rights reserved.