Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems (Q4713055)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5469
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.93675315
0 references
0.8913231
0 references
0.88756275
0 references
0.8848328
0 references
0 references
0.8742142
0 references
0 references
0.86924505
0 references
