"Approximate Counting of k-Paths: Simpler, Deterministic, and in ..."

Daniel Lokshtanov et al. (2021)

> Home

Details and statistics

DOI: 10.1145/3461477

access: closed

type: Journal Article

metadata version: 2021-08-12

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/LokshtanovBSZ21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/LokshtanovBSZ21
Daniel Lokshtanov, Andreas Björklund, Saket Saurabh, Meirav Zehavi:
Approximate Counting of k-Paths: Simpler, Deterministic, and in Polynomial Space. ACM Trans. Algorithms 17(3): 26:1-26:44 (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.