A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs (Q4314146)

From MaRDI portal
Revision as of 11:10, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 690966
Language Label Description Also known as
English
A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs
scientific article; zbMATH DE number 690966

    Statements

    A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs (English)
    0 references
    0 references
    20 November 1994
    0 references
    randomised approximation algorithm
    0 references
    randomised approximation scheme
    0 references
    counting the number of forests
    0 references
    dense graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references