Constructing Disjoint Paths on Expander Graphs (Extended Abstract)

David Peleg, Eli Upfal. Constructing Disjoint Paths on Expander Graphs (Extended Abstract). In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 25-27 May 1987, New York City, NY, USA. pages 264-273, ACM, 1987.

@inproceedings{PelegU87,
  title = {Constructing Disjoint Paths on Expander Graphs (Extended Abstract)},
  author = {David Peleg and Eli Upfal},
  year = {1987},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/PelegU87},
  cites = {0},
  citedby = {0},
  pages = {264-273},
  booktitle = {Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 25-27 May 1987, New York City, NY, USA},
  publisher = {ACM},
}