Jun 21, 2013 · We focus on counting list M-partitions, given a graph G and a list for each vertex of G. We identify a set of "tractable" matrices and give an ...

This paper focuses on the problem of counting list M-partitions, given a graph G and given lists for each vertex of G. We give an algorithm that solves this ...

The algorithm relies on data structures such as sparse-dense partitions and subcube decompositions to reduce each problem instance to a sequence of problem ...

This paper focuses on the problem of counting list M-partitions, given a graph G and given a list for each vertex of G. We identify a certain set of “tractable” ...

Mar 29, 2016 · If every component of H is a clique with a self-loop on every vertex, or is a complete bipartite graph, counting homomorphisms to H is in FP;.

Abstract. Given a symmetric matrix M ∈ {0, 1, ∗}D×D, an M-partition of a graph G is a function from V (G) to D such that no edge of G is mapped to a 0 of ...

An algorithm that solves the problem of counting list M-partitions in polynomial time for every (fixed) matrix M for which the problem is tractable is given ...

We give a computer-assisted proof that, when | D | = 4 , the problem of counting the M -partitions of an input graph is either in FP or is #P -complete.

This paper focuses on the problem of counting list M-partitions, given a graph G and given lists for each vertex of G.

COUNTING COMPLEXITY. 52. 3.5.1 Counting List Matrix Partitions of Graphs. Let M be a fixed partition matrix and denote by # List-M-partition the following ...