Parameterized complexity of secluded connectivity problems (Q2408560)

From MaRDI portal
Revision as of 13:57, 14 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Parameterized complexity of secluded connectivity problems
scientific article

    Statements

    title
    Parameterized complexity of secluded connectivity problems (English)
    0 references
    author
    Fedor V. Fomin
    0 references
    Nikolay Karpov
    0 references
    Alexander S. Kulikov
    0 references
    Petr A. Golovach
    0 references
    publication date
    12 October 2017
    0 references
    zbMATH Keywords
    secluded path
    0 references
    secluded Steiner tree
    0 references
    parameterized complexity
    0 references
    kernelization
    0 references
    cites work
    Color-coding
    0 references
    Q4198056
    0 references
    Q4231923
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    05C40
    0 references
    68R10
    0 references
    zbMATH DE Number
    6790466
    0 references
    OpenAlex ID
    W1532687347
    0 references
    Wikidata QID
    Q60488378
    0 references
    arXiv ID
    1502.03989
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2408560&oldid=36350299"
    Powered by MediaWiki