24 citations · 60 across the 8 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.CC2013
Counting list matrix partitions of graphs
Andreas Göbel, Leslie Ann Goldberg, Colin McQuillan +2
Given a symmetric D*D matrix M over {0,1,*}, a list M-partition of a graph G is a partition of G's vertices into D parts associated with the rows of M. The part of each vertex is c…
cs.CC2013★ 13 cited
Approximating Holant problems by winding
Colin McQuillan
We give an FPRAS for Holant problems with parity constraints and not-all-equal constraints, a generalisation of the problem of counting sink-free-orientations. The approach combine…