Finding a Maximum Clique in an Arbitrary Graph (Q3741641): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56210390, #quickstatements; #temporary_batch_1705765412645 |
Created claim: DBLP publication ID (P1635): journals/siamcomp/BalasY86, #quickstatements; #temporary_batch_1731508824982 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0215075 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2043005464 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/siamcomp/BalasY86 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
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
