Problems hard for treewidth but easy for stable gonality (Q6039413)

From MaRDI portal
Revision as of 02:33, 1 August 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7682403
Language Label Description Also known as
English
Problems hard for treewidth but easy for stable gonality
scientific article; zbMATH DE number 7682403

    Statements

    title
    Problems hard for treewidth but easy for stable gonality (English)
    0 references
    author
    Hans L. Bodlaender
    0 references
    Gunther Cornelissen
    0 references
    Marieke van der Wegen
    0 references
    publication date
    5 May 2023
    0 references
    zbMATH Keywords
    parameterized complexity
    0 references
    graph algorithms
    0 references
    network flow
    0 references
    graph orientation
    0 references
    capacitated dominating set
    0 references
    tree partitions
    0 references
    stable gonality
    0 references

    Identifiers

    arXiv ID
    2202.06838
    0 references
    zbMATH DE Number
    7682403
    0 references
    Wikidata QID
    Q126176056
    0 references
    OpenAlex ID
    W4312748023
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6039413&oldid=37513522"
    Powered by MediaWiki