Embedding the incomplete hypercube in books
From MaRDI portal
Publication:1044693
Recommendations
- Improved book-embeddings of incomplete hypercubes
- Embedding cycles and meshes onto incomplete hypercubes
- Incomplete hypercubes: Embeddings of tree-related networks
- Embedding of hypercubes into generalized books.
- An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength
Cites work
- scientific article; zbMATH DE number 4155887 (Why is no real title available?)
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- An effective routing algorithm in incomplete hypercubes
- Efficient generation of the binary reflected gray code and its applications
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Embedding cycles and meshes onto incomplete hypercubes
- Embedding planar graphs in four pages
- Optimum embedding of complete graphs in books
- Parallel routing algorithms for incomplete hypercube interconnection networks
Cited in
(11)- A survey on book-embedding of planar graphs
- Embedding of hypercubes into necklace, windmill and snake graphs
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
- Embedding complete multi-partite graphs into Cartesian product of paths and cycles
- Improved book-embeddings of incomplete hypercubes
- Wirelength of embedding complete multipartite graphs into certain graphs
- Embedding of the folded hypercubes into tori
- Embedding of hypercubes into generalized books.
- On linear layout of bicube and construction of optimal incomplete bicube
- Embedding generalized Petersen graph in books
- Embedding connected double-loop networks with even cardinality in books
This page was built for publication: Embedding the incomplete hypercube in books
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044693)
