Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems (Q4713055): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:21, 30 January 2024
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
25 June 1992
0 references
critical independent sets
0 references
critical vertex subsets
0 references
solvable in polynomial time
0 references
