Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs.

Ewan Davies Will Perkins

Published in: ICALP (2021)

Keyphrases

bounded degree
graph theoretic
bounded treewidth
maximal cliques
domain knowledge
information extraction
relational data
graph theory
polynomial size