On the complexity of the independent set problem in triangle graphs (Q2275391): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q57387734, #quickstatements; #temporary_batch_1711486624475 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q57387734 / rank | |||
Normal rank |
Revision as of 23:32, 26 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