On the complexity of the independent set problem in triangle graphs (Q2275391)
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 5936887
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the independent set problem in triangle graphs |
scientific article; zbMATH DE number 5936887 |
Statements
On the complexity of the independent set problem in triangle graphs (English)
0 references
8 August 2011
0 references
independent set
0 references
neighborhood set
0 references
triangle condition
0 references
triangle graph
0 references
\(NP\)-completeness
0 references
approximability
0 references
0 references
0 references
0 references
0.9271862
0 references
0.9180823
0 references
0.9144567
0 references
0 references
0.9102718
0 references
0.9055241
0 references
0.9037043
0 references
0.90255547
0 references
