A note on the computational complexity of graph vertex partition (Q868398)

From MaRDI portal
Revision as of 15:18, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A note on the computational complexity of graph vertex partition
scientific article

    Statements

    A note on the computational complexity of graph vertex partition (English)
    0 references
    0 references
    0 references
    2 March 2007
    0 references
    graph partition
    0 references
    stable set
    0 references
    deficiency number
    0 references
    polynomial algorithm
    0 references
    Xuong tree
    0 references

    Identifiers