Decomposing clique search problems into smaller instances based on node and edge colorings (Q1744248): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q326945 |
||
| Property / author | |||
| Property / author: Bogdán Zaválnij / rank | |||
Revision as of 04:27, 13 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decomposing clique search problems into smaller instances based on node and edge colorings |
scientific article |
Statements
Decomposing clique search problems into smaller instances based on node and edge colorings (English)
0 references
20 April 2018
0 references
\(k\)-clique
0 references
maximum clique
0 references
clique search algorithm
0 references
independent set
0 references
branch and bound
0 references
node coloring
0 references
edge coloring
0 references
greedy coloring
0 references
combinatorial optimization
0 references
