All-pairs disjoint paths from a common ancestor in O~(n:::infinit:::) time

Raphael Yuster. All-pairs disjoint paths from a common ancestor in O~(n:::infinit:::) time. Theoretical Computer Science, 396(1-3):145-150, 2008. [doi]

@article{Yuster08:1,
  title = {All-pairs disjoint paths from a common ancestor in O~(n:::infinit:::) time},
  author = {Raphael Yuster},
  year = {2008},
  doi = {10.1016/j.tcs.2008.01.032},
  url = {http://dx.doi.org/10.1016/j.tcs.2008.01.032},
  researchr = {https://researchr.org/publication/Yuster08%3A1},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {396},
  number = {1-3},
  pages = {145-150},
}