Finding a Maximum Clique in an Arbitrary Graph (Q3741641): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q56210390, #quickstatements; #temporary_batch_1705765412645 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56210390 / rank | |||
Normal rank | |||
Revision as of 16:51, 20 January 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
