A note on the complexity of computing the number of reachable vertices in a digraph

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]

Abstract

Abstract is missing.