Decomposing clique search problems into smaller instances based on node and edge colorings
Under a Creative Commons license
open access
Keywords
-clique
Maximum clique
Clique search algorithm
Independent set
Branch and Bound
Node coloring
Edge Coloring
Greedy coloring
Combinatorial optimization
Cited by (0)
© 2018 The Authors. Published by Elsevier B.V.