Kernelization and complexity results for connectivity augmentation problems (Q3057175)

From MaRDI portal
Revision as of 23:26, 29 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Kernelization and complexity results for connectivity augmentation problems
scientific article

    Statements

    Kernelization and complexity results for connectivity augmentation problems (English)
    0 references
    0 references
    0 references
    0 references
    24 November 2010
    0 references
    combinatorial problem
    0 references
    NP-complete problem
    0 references
    graph algorithm
    0 references
    fixed-parameter (in)tractability
    0 references
    data reduction
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references