Cite
HARVARD Citation
Dyer, M. et al. (2021). Counting independent sets in graphs with bounded bipartite pathwidth. Random structures & algorithms. 59 (2), pp. 204-237. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Dyer, M. et al. (2021). Counting independent sets in graphs with bounded bipartite pathwidth. Random structures & algorithms. 59 (2), pp. 204-237. [Online].