| Authors |
|
| Publication date |
2017
|
| Journal |
Electronic Notes in Discrete Mathematics
|
| Volume | Issue number |
61
|
| Pages (from-to) |
971-977
|
| Organisations |
-
Faculty of Science (FNWI) - Korteweg-de Vries Institute for Mathematics (KdVI)
-
Faculty of Science (FNWI)
|
| Abstract |
We show a new way of constructing deterministic polynomial-time approximation algorithms for computing complex-valued evaluations of a large class of graph polynomials on bounded degree graphs. Our approach works for the Tutte polynomial, the independence polynomial, and partition functions of complex-valued spin- and edge-coloring models.
|
| Document type |
Article
|
| Language |
English
|
| Published at |
https://doi.org/10.1016/j.endm.2017.07.061
|
| Other links |
https://www.scopus.com/pages/publications/85026744924
|
|
Permalink to this page
|