Counting Independent Sets in Cocomparability Graphs

Dyer, M and Müller, H (2019) Counting Independent Sets in Cocomparability Graphs. Information Processing Letters, 144. pp. 31-36. ISSN 0020-0190



Copyright, Publisher and Additional Information: (c) 2018, Elsevier B.V. All rights reserved. This is an author produced version of a paper published in Information Processing Letters. Uploaded in accordance with the publisher's self-archiving policy.
Keywords: Graph algorithms; Cocomparability graph; Independent set; Counting; Linear time algorithm
  • Accepted: 9 December 2018
  • Published (online): 11 December 2018
  • Published: April 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
EPSRC (Engineering and Physical Sciences Research Council)EP/S016562/1
Depositing User: Symplectic Publications
Date Deposited: 16 Jan 2019 14:23
Last Modified: 01 Jul 2020 22:38
Status: Published
Publisher: Elsevier
Identification Number: