Exact algorithms for counting 3-colorings of graphs (Q2081467)

From MaRDI portal
Revision as of 09:32, 30 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Exact algorithms for counting 3-colorings of graphs
scientific article

    Statements

    Exact algorithms for counting 3-colorings of graphs (English)
    0 references
    0 references
    0 references
    0 references
    13 October 2022
    0 references
    exact exponential-time algorithms
    0 references
    branch and reduce
    0 references
    measure and conquer
    0 references
    dynamic programming
    0 references
    0 references
    0 references
    0 references

    Identifiers

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