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

DOI10.1145/3461477OpenAlexW3183157744MaRDI QIDQ5032035

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

Publication date: 16 February 2022

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3461477

zbMATH Keywords

\(k\)-pathparameterized complexityparameterized counting problems

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items (1)

The complexity of pattern counting in directed graphs, parameterised by the outdegree

This page was built for publication: Approximate Counting of k -Paths: Simpler, Deterministic, and in Polynomial Space