An approach to emulating separable graphs

DOI10.1007/BF01187092zbMath0798.68012MaRDI QIDQ4277376

B. Obrenić

Publication date: 31 October 1994

Published in: Mathematical Systems Theory (Search for Journal in Brave)

zbMATH Keywords

hypercubesgraph embeddingsseparable graphsmulticomputer interconnection networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07)

Related Items

Separator-based graph embedding into multidimensional grids with small edge-congestion

Cites Work

• Unnamed Item
• Unnamed Item
• A framework for solving VLSI graph layout problems
• Product-shuffle networks: Toward reconciling shuffles and butterflies
• Bisection of Circle Colorings
• Optimal embeddings of butterfly-like graphs in the hypercube
• A unified framework for off-line permutation routing in parallel networks
• Universal Graphs for Bounded-Degree Trees and Planar Graphs
• Efficient Embeddings of Trees in Hypercubes
• Laying Out Graphs Using Queues
• Optimal emulations by butterfly-like networks
• Parallel Processing with the Perfect Shuffle