A note on the complexity of computing the number of reachable vertices in a digraph (Q2629773)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the complexity of computing the number of reachable vertices in a digraph |
scientific article |
Statements
A note on the complexity of computing the number of reachable vertices in a digraph (English)
0 references
7 July 2016
0 references
computational complexity
0 references
graph algorithms
0 references
strong exponential time hypothesis
0 references
reachability
0 references
transitive closure
0 references
0 references
