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

24 Oct 2018 Shimizu Satoshi Yamaguchi Kazuaki Masuda Sumio

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 branch-and-bound algorithms have been proposed... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DATA STRUCTURES AND ALGORITHMS