Finding a Maximum Clique in an Arbitrary Graph (Q3741641): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: DBLP publication ID (P1635): journals/siamcomp/BalasY86, #quickstatements; #temporary_batch_1731508824982 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/siamcomp/BalasY86 / rank | |||
Normal rank | |||
Latest revision as of 16:22, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a Maximum Clique in an Arbitrary Graph |
scientific article |
Statements
Finding a Maximum Clique in an Arbitrary Graph (English)
0 references
1986
0 references
vertex packing
0 references
triangulated subgraphs
0 references
k-chromatic subgraphs
0 references
implicit enumeration
0 references
maximum clique
0 references
