📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

Counting independent sets in graphs with bounded bipartite pathwidth (2021)

First Author: Dyer M

Attributed to: Sampling in Hereditary Classes funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1002/rsa.21003

Publication URI: http://dx.doi.org/10.1002/rsa.21003

Type: Journal Article/Review

Parent Publication: Random Structures & Algorithms

Issue: 2

ISSN: 1042-9832