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

From MaRDI portal
Revision as of 18:28, 26 April 2024 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7749486
Language Label Description Also known as
English
Counting independent sets in graphs with bounded bipartite pathwidth
scientific article; zbMATH DE number 7749486

    Statements

    Counting independent sets in graphs with bounded bipartite pathwidth (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 October 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximate counting
    0 references
    independent sets
    0 references
    pathwidth
    0 references