A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph (Q2032176)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph |
scientific article; zbMATH DE number 7360090
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph |
scientific article; zbMATH DE number 7360090 |
Statements
A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph (English)
0 references
16 June 2021
0 references
graph algorithms
0 references
reachability
0 references
transitive closure
0 references
parameterized algorithms
0 references
FPT in P
0 references
0 references
0 references
