Login / Signup
A note on the complexity of computing the number of reachable vertices in a digraph.
Michele Borassi
Published in:
Inf. Process. Lett. (2016)
Keyphrases
</>
small number
computational complexity
space complexity
real time
databases
information systems
search algorithm