Computing the partition function for graph homomorphisms
- 152 Downloads
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 effcient algorithms for computing weighted sums approximating the number of k-colorings and the number of independent sets in a graph, as well as an effcient procedure to distinguish pairs of edge-colored graphs with many color-preserving homomorphisms G → H from pairs of graphs that need to be substantially modified to acquire a color-preserving homomorphism G → H.
Mathematics Subject Classification (2000)15A15 68C25 68W25 60C05
Unable to display preview. Download preview PDF.
- P. Berman and M. Karpinski: On some tighter inapproximability results (extended abstract), Automata, languages and programming (Prague, 1999) 200-209, in: Lecture Notes in Computer Science, 1644, Springer, Berlin (1999).Google Scholar
- B. Bukh: Personal communication, (2015).Google Scholar
- L. Lovász: Large Networks and Graph Limits, American Mathematical Society Colloquium Publications, 60, American Mathematical Society, Providence, RI, 2012.Google Scholar
- D. Weitz: Counting independent sets up to the tree threshold, in: STOC’06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing 140-149, ACM, New York, 2006.Google Scholar