scientific article; zbMATH DE number 7561515
From MaRDI portal
Publication:5091171
DOI10.4230/LIPIcs.ICALP.2019.22zbMath1495.68164MaRDI QIDQ5091171
Daniel Štefanković, Andreas Galanis, Leslie Ann Goldberg, Ivona Bezáková
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph polynomials (05C31) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
Cites Work
- Unnamed Item
- Computing the permanent of (some) complex matrices
- From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems
- On a conjecture of Sokal concerning roots of the independence polynomial
- Spatial mixing and the connective constant: optimal bounds
- Theory of monomer-dimer systems
- Counting independent sets up to the tree threshold
- Approximating the Permanent
- Matchings and walks in graphs
- Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials
- Computing the Independence Polynomial: from the Tree Threshold down to the Roots
- Inapproximability of the independent set polynomial in the complex plane
This page was built for publication:
