Login / Signup

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

Ewan DaviesWill Perkins
Published in: SIAM J. Comput. (2023)
Keyphrases
  • bounded degree
  • graph theoretic
  • bounded treewidth
  • maximal cliques
  • learning algorithm