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

From MaRDI portal
scientific article
Language Label Description Also known as
English
Counting independent sets in graphs with bounded bipartite pathwidth
scientific article

    Statements

    Counting independent sets in graphs with bounded bipartite pathwidth (English)
    0 references
    0 references
    0 references
    0 references
    24 February 2020
    0 references
    Markov chain Monte Carlo algorithm
    0 references
    fully polynomial-time randomized approximation scheme
    0 references
    independent set
    0 references
    pathwidth
    0 references

    Identifiers