Optimal book embeddings of the FFT, Benes, and barrel shifter networks

DOI10.1007/BF01840445zbMath0639.94022MaRDI QIDQ1100131

Richard A. Games

Publication date: 1986

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

interconnection networksgraph embedding3-page book embeddingsbarrel shifter networkBenes rearrangeable permuation networkfault tolerant computingFFT network

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Applications of graph theory to circuits and networks (94C15)

Related Items (7)

A survey on book-embedding of planar graphs ⋮ Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI ⋮ Embedding de Bruijn, Kautz and shuffle-exchange networks in books ⋮ RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties ⋮ On the pagenumber of trivalent Cayley graphs ⋮ Structural properties of subdivided-line graphs ⋮ Improved book-embeddings of incomplete hypercubes

Cites Work

• The book thickness of a graph
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Optimal Rearrangeable Multistage Connecting Networks
• Parallel Processing with the Perfect Shuffle

This page was built for publication: Optimal book embeddings of the FFT, Benes, and barrel shifter networks