Improved book-embeddings of incomplete hypercubes

DOI10.1016/j.dam.2008.10.008zbMath1172.05017OpenAlexW2011707541MaRDI QIDQ1028113

Toru Hasunuma

Publication date: 30 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.10.008

zbMATH Keywords

interconnection networksbook-embeddingincomplete hypercubepagenumber

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Structural properties of subdivided-line graphs

Cites Work

• The pagenumber of the class of bandwidth-k graphs is \(k-1\)
• Embedding the incomplete hypercube in books
• Optimal book embeddings of the FFT, Benes, and barrel shifter networks
• Embedding planar graphs in four pages
• The book thickness of a graph
• An effective routing algorithm in incomplete hypercubes
• Parallel routing algorithms for incomplete hypercube interconnection networks
• Embedding de Bruijn, Kautz and shuffle-exchange networks in books
• Pagenumber of complete bipartite graphs
• Genus g Graphs Have Pagenumber O(√g)
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Embedding iterated line digraphs in books
• The pagenumber of \(k\)-trees is \(O(k)\)
• Unnamed Item
• Unnamed Item
• Unnamed Item