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

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

Research output: Contribution to journalArticlepeer-review

Fingerprint

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

Mathematics