Synthesizing minimum total expansion topologies for reconfigurable interconnection networks
- 1 August 1989
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 7 (1) , 178-199
- https://doi.org/10.1016/0743-7315(89)90057-9
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular GraphsPublished by Elsevier ,2013
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- A synthesis algorithm for reconfigurable interconnection networksIEEE Transactions on Computers, 1988
- Generating random regular graphsJournal of Algorithms, 1984
- Introduction to the configurable, highly parallel computerComputer, 1982
- The asymptotic distribution of short cycles in random regular graphsJournal of Combinatorial Theory, Series B, 1981
- Design of a Massively Parallel ProcessorIEEE Transactions on Computers, 1980
- Bounds on the costs of data encodingsTheory of Computing Systems, 1978
- Data encodings and their costsActa Informatica, 1978
- A lower bound on the average shortest path length in regular graphsNetworks, 1974