A Maximum Edge-Weight Clique Extraction Algorithm Based on Branch-and-Bound

Satoshi Shimizu, Kazuaki Yamaguchi, Sumio Masuda

The maximum edge-weight clique problem is to find a clique whose sum of edge-weight is the maximum for a given edge-weighted undirected graph. The problem is NP-hard and some branc…