14 citations · 32 across the 19 of their papers we have counts for
1 paper · 1 filter
Andreas Björklund, Thore Husfeldt, Petteri Kaski +1
The deletion--contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomials…