On the Parallel Complexity of Digraph Reachability

Samir Khuller, Uzi Vishkin. On the Parallel Complexity of Digraph Reachability. Inf. Process. Lett., 52(5):239-241, 1994.

@article{KhullerV94,
  title = {On the Parallel Complexity of Digraph Reachability},
  author = {Samir Khuller and Uzi Vishkin},
  year = {1994},
  researchr = {https://researchr.org/publication/KhullerV94},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {52},
  number = {5},
  pages = {239-241},
}