A unified approach to off-line permutation routing on parallel networks
Fred S. Annexstein, Marc Baumslag · 1990
A unified framework for finding efficient permutation routes on parallel networks in an off-line setting is presented.If the underlying graph of a parallel network contains an appropriate "approximate" product structure then our method guarantees the existence of non-blocking near-optimal permutation routes.The routes in question can be determined in polynomial time.Furthermore, our results are extended to finding permutation routes among the remaining "live" nodes in a faulty network.