Jia-wei Hong, Arnold L. Rosenberg
Abstract. An embedding of the graph G in the graph H is a one-to-one association of the vertices of G with the vertices of H. There are two natural measures of the cost of a graph embedding, namely,...
Optimal Simulations by Butterfly Networks: Extended Abstract, (1998)
Bhatt, Sandeep N., Chung, Fan R., Hong, Jia-Wei, Leighton, F. T., Rosenberg, Arnold
We investigate the power of the Butterfly network (which is the FFT network with inputs and outputs identified) relative to other proposed multicomputer interconnection networks, by considering how...
Optimal Simulations by Butterfly Networks. (1998)
Bhatt, Sandeep N., Chung, Fan R., Hong, Jia-Wei, Leighton, F. T., Rosenberg, Arnold L.
The power of Butterfly-type networks relative to other proposed multicomputer interconnection networks is studied, by considering how efficiently the Butterfly can simulate the other networks....
Optimal Emulations by Butterfly-Like Networks (1996)
Sandeep N. Bhatt, Jia-wei Hong, F. Thomson Leighton, Arnold L. Rosenberg, Eric J. Schwabe, ...
The power of butterfly-like networks as multicomputer interconnection networks is studied, by considering how efficiently the butterfly can emulate other networks. Emulations are studied formally via...
Cost Trade-offs in Graph Embeddings, with Applications (1983)
Hong, Jia-Wei, Mehlhorn, Kurt, Rosenberg, Arnold L.
An embedding of the graph G in the graph H is a one-to-one association of the vertices of G with the vertices of H. There are two natural measures of the cost of a graph embedding, namely, the...