Improved book-embeddings of incomplete hypercubes
type: Item
instance of: scholarly article
title: Improved book-embeddings of incomplete hypercubes
zbMATH Open document ID: 1172.05017
author: Toru Hasunuma
published in: Discrete Applied Mathematics
publication date: 2009-06-30T00:00:00Z
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 5571986
zbMATH Keywords: book-embedding
zbMATH Keywords: pagenumber
zbMATH Keywords: incomplete hypercube
zbMATH Keywords: interconnection networks
MaRDI profile type: Publication
full work available at URL: j.dam.2008.10.008
OpenAlex ID: W2011707541
cites work: The book thickness of a graph
cites work: Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
cites work: Q3374865
cites work: Embedding the incomplete hypercube in books
cites work: Optimal book embeddings of the FFT, Benes, and barrel shifter networks
cites work: The pagenumber of \(k\)-trees is \(O(k)\)
cites work: Embedding iterated line digraphs in books
cites work: Embedding de Bruijn, Kautz and shuffle-exchange networks in books
cites work: Parallel routing algorithms for incomplete hypercube interconnection networks
cites work: An effective routing algorithm in incomplete hypercubes
cites work: Q4002466
cites work: Genus g Graphs Have Pagenumber O(√g)
cites work: Pagenumber of complete bipartite graphs
cites work: The pagenumber of the class of bandwidth-k graphs is \(k-1\)
cites work: Q3043733
cites work: Embedding planar graphs in four pages
DOI: 10.1016/J.DAM.2008.10.008
description: scientific article; zbMATH DE number 5571986