Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths

Qian-Ping Gu, Hisao Tamaki. Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths. In Proceedings of IPPS 96, The 10th International Parallel Processing Symposium, April 15-19, 1996, Honolulu, Hawaii, USA. pages 561-567, IEEE Computer Society, 1996. [doi]

@inproceedings{GuT96,
  title = {Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths},
  author = {Qian-Ping Gu and Hisao Tamaki},
  year = {1996},
  url = {http://computer.org/proceedings/ipps/7255/72550561abs.htm},
  tags = {routing},
  researchr = {https://researchr.org/publication/GuT96},
  cites = {0},
  citedby = {0},
  pages = {561-567},
  booktitle = {Proceedings of IPPS  96, The 10th International Parallel Processing Symposium, April 15-19, 1996, Honolulu, Hawaii, USA},
  publisher = {IEEE Computer Society},
  isbn = {0-8186-7255-2},
}