Highly Influenced

We introduce the partition function of edge-colored graph homomorphisms, of which the usual partition function of graph homomorphisms is a specialization, and present an efficient algorithm to approximate it in a certain domain. Corollaries include efficient algorithms for computing weighted sums approximating the number of k-colorings and the number of… (More)

Citations per Year

Averaging **7 citations** per year over the last 3 years.

### Presentations referencing similar topics