Skip to main navigation Skip to search Skip to main content

Approximate Counting of k-Paths: Simpler, Deterministic, and in Polynomial Space

  • Daniel Lokshtanov
  • , Andreas Björklund
  • , Saket Saurabh
  • , Meirav Zehavi

Research output: Contribution to journal › Article › peer-review

12 Scopus citations

Fingerprint

Dive into the research topics of 'Approximate Counting of k-Paths: Simpler, Deterministic, and in Polynomial Space'. Together they form a unique fingerprint.
Sort by

Mathematics

Keyphrases