Michele Borassi. A note on the complexity of computing the number of reachable vertices in a digraph. Inf. Process. Lett., 116(10):628-630, 2016. [doi]
@article{Borassi16,
title = {A note on the complexity of computing the number of reachable vertices in a digraph},
author = {Michele Borassi},
year = {2016},
doi = {10.1016/j.ipl.2016.05.002},
url = {http://dx.doi.org/10.1016/j.ipl.2016.05.002},
researchr = {https://researchr.org/publication/Borassi16},
cites = {0},
citedby = {0},
journal = {Inf. Process. Lett.},
volume = {116},
number = {10},
pages = {628-630},
}