The complexity of finding uniform emulations on paths and ring networks
- 1 May 1990
- journal article
- Published by Elsevier in Information and Computation
- Vol. 86 (1) , 87-106
- https://doi.org/10.1016/0890-5401(90)90027-f
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Simulation of large networks on smaller networksInformation and Control, 1986
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problemJournal of Algorithms, 1984
- On Some Variants of the Bandwidth Minimization ProblemSIAM Journal on Computing, 1984
- Quotient NetworksIEEE Transactions on Computers, 1982
- Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial TimeSIAM Journal on Algebraic Discrete Methods, 1980
- Complexity Results for Bandwidth MinimizationSIAM Journal on Applied Mathematics, 1978