Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs

Dyer, M orcid.org/0000-0002-2018-0374, Heinrich, M, Jerrum, M et al. (1 more author) (2021) Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs. Combinatorics, Probability and Computing, abs/2005.07944. ISSN 0963-5483

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: This article has been published in a revised form in Combinatorics, Probability and Computing [http://doi.org/10.1017/S0963548321000080]. This version is free to view and download for private research and study only. Not for re-distribution, re-sale or use in derivative works. © The Author(s), 2021. Published by Cambridge University Press
Dates:
  • Accepted: 17 March 2021
  • Published (online): 12 April 2021
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Funding Information:
FunderGrant number
EPSRC (Engineering and Physical Sciences Research Council)EP/S016562/1
Depositing User: Symplectic Publications
Date Deposited: 25 May 2021 14:44
Last Modified: 12 Oct 2021 00:38
Status: Published online
Publisher: Cambridge University Press (CUP)
Identification Number: https://doi.org/10.1017/S0963548321000080

Export

Statistics