@article{fdi:010049038,
  title = {{R}outing automorphisms of the hypercube},
  author = {{Y}onta, {P}. {M}. and {T}chuente, {M}aurice and {N}doundam, {R}.},
  editor = {},
  language = {{ENG}},
  abstract = {{W}e present an online algorithm for routing the automorphisms ({BPC} permutations) of the queueless {MIMD} hypercube. {T}he routing algorithm has the virtue of being executed by each node of the hypercube without knowing the state of the others nodes. {T}he algorithm is also vertex and link-contention free. {W}e show, using the proposed algorithm, that {BPC} permutations are arbitrarily routable in the considered communication model.},
  keywords = {{G}raph algorithms ; {H}ypercube ; {Q}ueueless {MIMD} ; {BPC} permutation ; {A}rbitrarily routable},
  booktitle = {},
  journal = {{I}nformation {P}rocessing {L}etters},
  volume = {110},
  numero = {20},
  pages = {854--860},
  ISSN = {0020-0190},
  year = {2010},
  DOI = {10.1016/j.ipl.2010.07.002},
  URL = {https://www.documentation.ird.fr/hor/fdi:010049038},
}