A \(9k\) kernel for nonseparating independent set in planar graphs (Q385964)

From MaRDI portal
Revision as of 14:11, 18 April 2024 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
A \(9k\) kernel for nonseparating independent set in planar graphs
scientific article

    Statements

    A \(9k\) kernel for nonseparating independent set in planar graphs (English)
    0 references
    0 references
    0 references
    13 December 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    fixed parameter algorithms
    0 references
    kernelization
    0 references
    planar graphs
    0 references
    connected vertex cover
    0 references
    nonseparating independent set
    0 references
    0 references
    0 references