An approach to emulating separable graphs
- 1 January 1994
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 27 (1) , 41-63
- https://doi.org/10.1007/bf01187092
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Optimal emulations by butterfly-like networksJournal of the ACM, 1996
- Efficient Embeddings of Trees in HypercubesSIAM Journal on Computing, 1992
- A unified framework for off-line permutation routing in parallel networksTheory of Computing Systems, 1991
- Optimal embeddings of butterfly-like graphs in the hypercubeTheory of Computing Systems, 1990
- Universal Graphs for Bounded-Degree Trees and Planar GraphsSIAM Journal on Discrete Mathematics, 1989
- Fault tolerance in hypercube-derivative networksPublished by Association for Computing Machinery (ACM) ,1989
- Optimal Simulations by Butterfly NetworksPublished by Defense Technical Information Center (DTIC) ,1988
- Optimal simulations of tree machinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Bisection of Circle ColoringsSIAM Journal on Algebraic Discrete Methods, 1985
- A framework for solving VLSI graph layout problemsJournal of Computer and System Sciences, 1984