Embedding de Bruijn, Kautz and shuffle-exchange networks in books

DOI10.1016/S0166-218X(97)00009-7zbMath0890.68100WikidataQ56689191 ScholiaQ56689191MaRDI QIDQ1377659

Yukio Shibata, Toru Hasunuma

Publication date: 23 June 1998

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

Kautz digraphde Bruijn digraphshuffle-exchange graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

Algorithms for the fixed linear crossing number problem ⋮ A survey on book-embedding of planar graphs ⋮ Graphs with the unique path property: Structure, cycles, factors, and constructions ⋮ On the pagenumber of trivalent Cayley graphs ⋮ Structural properties of subdivided-line graphs ⋮ Improved book-embeddings of incomplete hypercubes

Cites Work

• Unnamed Item
• Optimal book embeddings of the FFT, Benes, and barrel shifter networks
• Embedding planar graphs in four pages
• The book thickness of a graph
• Pagenumber of complete bipartite graphs
• Broadcasting and Gossiping in de Bruijn Networks
• Embedding de Bruijn and Shuffle-Exchange Graphs in Five Pages
• The pagenumber of genus g graphs is O( g )
• Genus g Graphs Have Pagenumber O(√g)
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design

This page was built for publication: Embedding de Bruijn, Kautz and shuffle-exchange networks in books