Efficient Computation of Generalized Ising Polynomials on Graphs with Fixed Clique-Width
From MaRDI portal
Publication:2798025
DOI10.1007/978-3-319-28678-5_10zbMath1460.68077arXiv1505.06617OpenAlexW2126278362MaRDI QIDQ2798025
Tomer Kotek, Johann A. Makowsky
Publication date: 1 April 2016
Published in: Topics in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.06617
Analysis of algorithms and problem complexity (68Q25) Graph polynomials (05C31) Graph theory (including graph drawing) in computer science (68R10) Logic in computer science (03B70)
This page was built for publication: Efficient Computation of Generalized Ising Polynomials on Graphs with Fixed Clique-Width
