The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem (Q5249786)

From MaRDI portal
Revision as of 16:31, 30 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6435298
Language Label Description Also known as
English
The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem
scientific article; zbMATH DE number 6435298

    Statements

    The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem (English)
    0 references
    12 May 2015
    0 references
    independent number
    0 references
    \(H\)-packing number
    0 references

    Identifiers