On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks

Juraj Hromkovic, Przemyslawa Kanarek, Ralf Klasing, Krzysztof Lorys, Walter Unger, Hubert Wagener. On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks. SIAM J. Discrete Math., 23(3):1612-1645, 2009. [doi]

@article{HromkovicKKLUW09,
  title = {On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks},
  author = {Juraj Hromkovic and Przemyslawa Kanarek and Ralf Klasing and Krzysztof Lorys and Walter Unger and Hubert Wagener},
  year = {2009},
  doi = {10.1137/060669164},
  url = {http://dx.doi.org/10.1137/060669164},
  researchr = {https://researchr.org/publication/HromkovicKKLUW09},
  cites = {0},
  citedby = {0},
  journal = {SIAM J. Discrete Math.},
  volume = {23},
  number = {3},
  pages = {1612-1645},
}