A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph

Naoto Ohsaka. A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph. Inf. Process. Lett., 171:106137, 2021. [doi]

Authors

Naoto Ohsaka

This author has not been identified. Look up 'Naoto Ohsaka' in Google