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

From MaRDI portal
Revision as of 01:11, 28 June 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q126176056, #quickstatements; #temporary_batch_1719529644846)
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

    Problems hard for treewidth but easy for stable gonality (English)
    0 references
    0 references
    0 references
    0 references
    5 May 2023
    0 references
    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