A faster tree-decomposition based algorithm for counting linear extensions (Q786030)

From MaRDI portal
Revision as of 00:30, 29 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127173469, #quickstatements; #temporary_batch_1722205759638)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A faster tree-decomposition based algorithm for counting linear extensions
scientific article

    Statements

    title
    A faster tree-decomposition based algorithm for counting linear extensions (English)
    0 references
    author
    Kustaa Kangas
    0 references
    Mikko Koivisto
    0 references
    Sami Salonen
    0 references
    published in
    Algorithmica
    0 references
    publication date
    12 August 2020
    0 references
    zbMATH Keywords
    algorithm selection
    0 references
    empirical hardness
    0 references
    linear extension
    0 references
    multiplication of polynomials
    0 references
    tree decomposition
    0 references
    describes a project that uses
    WEKA
    0 references
    htd
    0 references
    FLINT
    0 references
    cites work
    Q5283021
    0 references
    Q4918387
    0 references
    Q2810856
    0 references
    Q3851094
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68W05
    0 references
    05C05
    0 references
    06A07
    0 references
    68W40
    0 references
    zbMATH DE Number
    7233372
    0 references
    OpenAlex ID
    W2960650218
    0 references
    Wikidata QID
    Q127173469
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q786030&oldid=36802481"
    Powered by MediaWiki