Decomposing clique search problems into smaller instances based on node and edge colorings (Q1744248)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Decomposing clique search problems into smaller instances based on node and edge colorings |
scientific article; zbMATH DE number 6862775
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decomposing clique search problems into smaller instances based on node and edge colorings |
scientific article; zbMATH DE number 6862775 |
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
0.8140151500701904
0 references
0.8091363906860352
0 references
0.7894229888916016
0 references
0.7599360942840576
0 references
0.7550622224807739
0 references
