Counting independent sets in graphs with bounded bipartite pathwidth

Dyer, M, Greenhill, C and Müller, H (2019) Counting independent sets in graphs with bounded bipartite pathwidth. In: Sau, I and Thilikos, D, (eds.) Graph-Theoretic concepts in computer science. Lecture Notes in Computer Science 11789. WG 2019, 19-21 Jun 2019, Vall de Nuria, Catalonia, Spain. Springer Verlag . ISBN 9783030307851



  • Dyer, M
  • Greenhill, C
  • Müller, H
Copyright, Publisher and Additional Information: © Springer Nature Switzerland AG 2019. This is an author produced version of a paper published in Lecture Notes in Computer Science. Uploaded in accordance with the publisher's self-archiving policy.
Keywords: Markov chain Monte Carlo algorithm; Fully polynomial-time randomized approximation scheme; Independent set; Pathwidth
  • Accepted: 19 April 2019
  • Published (online): 12 September 2019
  • Published: 12 September 2019
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
Depositing User: Symplectic Publications
Date Deposited: 17 Jul 2019 12:39
Last Modified: 12 Sep 2020 00:38
Status: Published
Publisher: Springer Verlag
Identification Number: