Counting independent sets in strongly orderable graphs
Discrete Mathematics
2021-01-07 v1
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 .
Cite
@article{arxiv.2101.01997,
title = {Counting independent sets in strongly orderable graphs},
author = {Marc Heinrich and Haiko Müller},
journal= {arXiv preprint arXiv:2101.01997},
year = {2021}
}