Learning Heuristics for the Maximum Clique Enumeration Problem Using Low Dimensional Representations

Ali Baran Taşdemir, Tuna Karacan, Emir Kaan Kırmacı +1

Approximate solutions to various NP-hard combinatorial optimization problems have been found by learned heuristics using complex learning models. In particular, vertex (node) class…