Nov 1, 2017 · We study the complexity of approximating the independent set polynomial Z_G(\lambda) of a graph G with maximum degree \Delta when the activity \lambda is a ...
Abstract. We study the complexity of approximating the value of the independent set polynomial Z G ( λ ) of a graph G with maximum degree Δ when the activity λ ...
Abstract. We study the complexity of approximating the value of the independent set polyno- mial ZG(\lambda ) of a graph G with maximum degree \Delta when ...
We study the complexity of approximating the value of the independent set polynomial ZG(λ) of a graph G with maximum degree Δ when the activity λ is a complex ...
2018. Inapproximability of the Independent Set Polynomial in the. Complex Plane. In Proceedings of 50th Annual ACM SIGACT Symposium on the Theory of Computing ( ...
Hard-core model (also known as independent set polynomial) is one of the simplest models in statistical physics. The complexity of approximating the value ...
The goal of this paper is to accurately describe the maximal zero-free region of the independence polynomial for graphs of bounded degree, for large degree ...
Duration: 53:52
Posted: Mar 18, 2019
Posted: Mar 18, 2019
An independent set in G is a subset I ⊆ V that contains no edge e ∈ E. Let I(G) denote the set of all independent sets of G. The independence polynomial of ...
We study the complexity of approximating the value of the independent set polynomial $Z_G(\lambda)$ of a graph $G$ with maximum degree $\Delta$ when the ...