Hard graphs for the maximum clique problem (Q5899769): 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/0012-365x(88)90207-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2078489643 / rank | |||
Normal rank | |||
Latest revision as of 09:40, 30 July 2024
scientific article; zbMATH DE number 4144014
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hard graphs for the maximum clique problem |
scientific article; zbMATH DE number 4144014 |
Statements
Hard graphs for the maximum clique problem (English)
0 references
1988
0 references
The paper presented deals with properties of soft graphs, i.e. ones for which there exists a reduction technique allowing to solve a maximum clique problem in polynomial time.
0 references
NP-complete problems
0 references
independent clique problem
0 references
maximum clique problem
0 references
