[PDF][PDF] Conflict directed clause learning for the maximum weighted clique problem
E Hebrard, G Katsirelos - 27th International Joint Conference on …, 2018 - homepages.laas.fr
The maximum clique and minimum vertex cover problems are among Karp's 21 NP-
complete problems, and have numerous applications: in combinatorial auctions, for …
complete problems, and have numerous applications: in combinatorial auctions, for …
[PDF][PDF] Clique-Based Encodings for Graph Edit Distance
P Dilkas - 2017 - dilkas.github.io
Graph edit distance (GED) is a common way to quantify the similarity between two graphs.
We propose two ways to encode it into a clique-based problem with additional constraints …
We propose two ways to encode it into a clique-based problem with additional constraints …