On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths. Extended Abstract

Dominique Barth, Sylvie Corteel, Alain Denise, Danièle Gardy, Mario Valencia-Pabon. On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths. Extended Abstract. In Gaston H. Gonnet, Daniel Panario, Alfredo Viola, editors, LATIN 2000: Theoretical Informatics, 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000, Proceedings. Volume 1776 of Lecture Notes in Computer Science, pages 308-317, Springer, 2000.

@inproceedings{BarthCDGV00,
  title = {On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths. Extended Abstract},
  author = {Dominique Barth and Sylvie Corteel and Alain Denise and Danièle Gardy and Mario Valencia-Pabon},
  year = {2000},
  tags = {routing},
  researchr = {https://researchr.org/publication/BarthCDGV00},
  cites = {0},
  citedby = {0},
  pages = {308-317},
  booktitle = {LATIN 2000: Theoretical Informatics, 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000, Proceedings},
  editor = {Gaston H. Gonnet and Daniel Panario and Alfredo Viola},
  volume = {1776},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-67306-7},
}