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. In this paper, we propose a new exact algorithm based on the branch-and-bound method. It assigns edge-weights to vertices and calculates upper bounds using vertex coloring. By some computational experiments, we confirmed our algorithm works fine.

中文翻译：

---

基于分支定界的最大边缘权集团提取算法

最大边权重集团问题是找到对于给定的边权重无向图，其边权重之和是最大值的集团。该问题是NP难的，并且已经提出了一些分支定界算法。在本文中，我们提出了一种基于分支定界法的精确算法。它将权重分配给顶点，并使用顶点着色计算上限。通过一些计算实验，我们证实了我们的算法可以正常工作。