Computing the partition function for cliques in a graph
From MaRDI portal
Publication:3467519
DOI10.4086/toc.2015.v011a013zbMath1351.05212arXiv1405.1974OpenAlexW2963364787MaRDI QIDQ3467519
Publication date: 2 February 2016
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.1974
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Computing the permanent of (some) complex matrices, Algorithmic Pirogov-Sinai theory, Computing the partition function for graph homomorphisms with multiplicities, Correlation decay and the absence of zeros property of partition functions, Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials, Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials, Computing the Partition Function of a Polynomial on the Boolean Cube, The Ising partition function: zeros and deterministic approximation, Approximating permanents and hafnians, Computing the partition function for graph homomorphisms, Zero-free regions of partition functions with applications to algorithms and graph limits, On a conjecture of Sokal concerning roots of the independence polynomial, Testing for Dense Subsets in a Graph via the Partition Function, Gauges, loops, and polynomials for partition functions of graphical models
Cites Work
