Heinrich, M and Müller, H orcid.org/0000-0002-1123-1774 (2021) Counting independent sets in strongly orderable graphs. [Preprint - arXiv]
Abstract
We consider the problem of devising algorithms to count exactly the number of independent sets of a graph G . We show that there is a polynomial time algorithm for this problem when G is restricted to the class of strongly orderable graphs, a superclass of chordal bipartite graphs. We also show that such an algorithm exists for graphs of bounded clique-width. Our results extends to a more general setting of counting independent sets in a weighted graph and can be used to count the number of independent sets of any given size k.
Metadata
Item Type: | Preprint |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | This is an open access preprint under the terms of the Creative Commons Attribution-Noncommercial-Sharealike 4.0 International Licence. |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) |
Funding Information: | Funder Grant number EPSRC (Engineering and Physical Sciences Research Council) EP/S016562/1 |
Depositing User: | Symplectic Publications |
Date Deposited: | 12 Dec 2024 15:45 |
Last Modified: | 13 Dec 2024 08:53 |
Published Version: | https://arxiv.org/abs/2101.01997 |
Identification Number: | 10.48550/arXiv.2101.01997 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:179329 |
Download
Filename: Counting independent sets in strongly orderable graphs.pdf
Licence: CC-BY-NC-SA 4.0