Planar graph vertex partition for linear problem kernels (Q355502)

From MaRDI portal
Revision as of 16:43, 6 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
Planar graph vertex partition for linear problem kernels
scientific article

    Statements

    Planar graph vertex partition for linear problem kernels (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 July 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    parameterized algorithm
    0 references
    kernelization
    0 references
    connected vertex cover
    0 references
    edge dominating set
    0 references
    maximum triangle packing
    0 references
    0 references