56 citations · 270 across the 25 of their papers we have counts for
Showing 2019 · cs.DMShow all
2 papers · 2 filters
cs.DM2019★ 3 cited
Maximum independent sets in (pyramid, even hole)-free graphs
Maria Chudnovsky, Stéphan Thomassé, Nicolas Trotignon +1
A \emph{hole} in a graph is an induced cycle with at least 4 vertices. A graph is \emph{even-hole-free} if it does not contain a hole on an even number of vertices. A \emph{pyramid…
cs.DM2019★ 7 cited
Counting weighted independent sets beyond the permanent
Martin Dyer, Mark Jerrum, Haiko Muller +1
Jerrum, Sinclair and Vigoda (2004) showed that the permanent of any square matrix can be estimated in polynomial time. This computation can be viewed as approximating the partition…