Approximately counting independent sets of a given size in bounded-degree graphs.

Ewan Davies Will Perkins

Published in: CoRR (2021)

Keyphrases

np complete
bounded treewidth

bounded degree
computational complexity

conjunctive queries
graph theoretic

social networks
prior knowledge