On the complexity of the independent set problem in triangle graphs (Q2275391): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2011.04.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2091196599 / rank | |||
Normal rank | |||
Revision as of 03:30, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the independent set problem in triangle graphs |
scientific article |
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
