Approximately counting independent sets in bipartite graphs via graph containers

DOI10.1137/1.9781611977073.24MaRDI QIDQ6575096

Matthew Jenssen, Will Perkins, Aditya Potukuchi

Publication date: 19 July 2024

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Algorithms for the ferromagnetic Potts model on expanders

This page was built for publication: Approximately counting independent sets in bipartite graphs via graph containers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575096)