Treewidth computations. I: Upper bounds (Q964001)

From MaRDI portal
Revision as of 06:20, 10 May 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q59567681, #quickstatements; #temporary_batch_1715314706700)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Treewidth computations. I: Upper bounds
scientific article

    Statements

    title
    Treewidth computations. I: Upper bounds (English)
    0 references
    author
    Hans L. Bodlaender
    0 references
    Arie M. C. A. Koster
    0 references
    publication date
    14 April 2010
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    68W10
    0 references
    68W25
    0 references
    05C85
    0 references
    zbMATH DE Number
    5692853
    0 references
    zbMATH Keywords
    treewidth
    0 references
    upper bounds
    0 references
    heuristics
    0 references
    approximation algorithms
    0 references
    graph algorithms
    0 references
    describes a project that uses
    DIMACS
    0 references
    Boost
    0 references
    ComputeTW
    0 references
    BGL
    0 references
    Treewidthlib
    0 references
    OpenAlex ID
    W2116793595
    0 references
    Wikidata QID
    Q59567681
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q964001&oldid=34074165"
    Powered by MediaWiki