"A fully polynomial parameterized algorithm for counting the number of ..."

Naoto Ohsaka (2021)

> Home

Details and statistics

DOI: 10.1016/J.IPL.2021.106137

access: closed

type: Journal Article

metadata version: 2021-06-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/Ohsaka21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/Ohsaka21
Naoto Ohsaka:
A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph. Inf. Process. Lett. 171: 106137 (2021)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.