Complexity of secure sets (Q722534)

From MaRDI portal
Revision as of 02:42, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/algorithmica/BliemW18, #quickstatements; #temporary_batch_1731461124002)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexity of secure sets
scientific article

    Statements

    title
    Complexity of secure sets (English)
    0 references
    author
    Bernhard Bliem
    0 references
    Stefan Woltran
    0 references
    published in
    Algorithmica
    0 references
    publication date
    26 July 2018
    0 references
    zbMATH Keywords
    secure set
    0 references
    complexity analysis
    0 references
    parameterized complexity
    0 references
    treewidth
    0 references
    parameterized algorithms
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    05C85
    0 references
    68Q17
    0 references
    68R10
    0 references
    zbMATH DE Number
    6911193
    0 references
    OpenAlex ID
    W2749113736
    0 references
    Wikidata QID
    Q55312596
    0 references
    arXiv ID
    1411.6549
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q722534&oldid=37892125"
    Powered by MediaWiki