Embedding graphs in books: a layout problem with applications to VLSI design
SIAM Journal on Algebraic and Discrete Methods
IEEE Transactions on Computers
Embedding planar graphs in four pages
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Genus g graphs have pagenumber O g
Journal of Algorithms
Structural and Tree Embedding Aspects of Incomplete Hypercubes
IEEE Transactions on Computers
An effective routing algorithm in incomplete hypercubes
Parallel Computing
The pagenumber of the class of bandwidth-k graphs is k−1
Information Processing Letters
Embedding de Bruijn, Kautz and shuffle-exchange networks in books
Discrete Applied Mathematics
The pagenumber of k-trees is O(k)
Discrete Applied Mathematics
Bounded Degree Book Embeddings and Three-Dimensional Orthogonal Graph Drawing
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Embedding the incomplete hypercube in books
Information Processing Letters
Linear Layout of the Supercube
IEICE - Transactions on Information and Systems
The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors
IEEE Transactions on Computers
| Hi-index | 0.04 |
In this paper, we show that any incomplete hypercube with, at most, 2^n+2^n^-^1+2^n^-^2 vertices can be embedded in n-1 pages for all n=4. For the case n=4, this result improves Fang and Lai's result that any incomplete hypercube with, at most, 2^n+2^n^-^1 vertices can be embedded in n-1 pages for all n=2. Besides this, we show that the result can be further improved when n is large - e.g., any incomplete hypercube with at most 2^n+2^n^-^1+2^n^-^2+2^n^-^7 (respectively, 2^n+2^n^-^1+2^n^-^2+2^n^-^7+2^n^-^2^3^0) vertices can be embedded in n-1 pages for all n=9 (respectively, n=232).