Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems (Q4713055)

From MaRDI portal
Revision as of 03:05, 3 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5469
Language Label Description Also known as
English
Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems
scientific article; zbMATH DE number 5469

    Statements

    Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems (English)
    0 references
    0 references
    25 June 1992
    0 references
    critical independent sets
    0 references
    critical vertex subsets
    0 references
    solvable in polynomial time
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references