APA-Zitierstil (7. Ausg.)

Ohsaka, N. (2021). A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph. Information processing letters, 171, 106137. https://doi.org/10.1016/j.ipl.2021.106137

Chicago-Zitierstil (17. Ausg.)

Ohsaka, Naoto. "A Fully Polynomial Parameterized Algorithm for Counting the Number of Reachable Vertices in a Digraph." Information Processing Letters 171 (2021): 106137. https://doi.org/10.1016/j.ipl.2021.106137.

MLA-Zitierstil (9. Ausg.)

Ohsaka, Naoto. "A Fully Polynomial Parameterized Algorithm for Counting the Number of Reachable Vertices in a Digraph." Information Processing Letters, vol. 171, 2021, p. 106137, https://doi.org/10.1016/j.ipl.2021.106137.