Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems (Q4713055): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2054991375 / rank | |||
Normal rank | |||
Latest revision as of 21:19, 19 March 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
