This repository contains an implementation of the dynamic programm of Diaz, Serna and Thilikos for computing the number of homomorphisms between two graphs and a modified version of it. The ...

Abstract: Graph covers and the Bethe free energy have been useful theoretical tools for producing lower bounds on a variety of counting problems in graphical models, including the permanent and the ...

Implementation of the dynamic program of diaz, serna and thilikos for counting graph homomorphisms with some modifications presented in my thesis ...

For two finite graphs G and H, let hom(G;H) denote the number of homomorphisms (adjacency-preserving mappings) from G to H. Counting homomorphisms between graphs has many interesting aspects.

The theory of convergent graph sequences has been worked out in two extreme cases, dense graphs and bounded degree graphs. One can define convergence in terms of counting homomorphisms from fixed ...