文件名称:Ostergard_A-New-Algorithm-for-the-Maximum-Weight-
介绍说明－－下载内容均来自于网络，请自行研究使用
Given a graph, in the maximum clique problem one wants to find the largest number
of vertices any two of which are adjacent. In the maximum-weight clique problem,
the vertices have weights, and one wants to find a clique with maximum weight. A
recently developed algorithm for the maximum clique problem is here transformed
into an algorithm for the weighted case. Computational experiments with random
graphs show that this new algorithm in many cases is faster than earlier algorithms.
of vertices any two of which are adjacent. In the maximum-weight clique problem,
the vertices have weights, and one wants to find a clique with maximum weight. A
recently developed algorithm for the maximum clique problem is here transformed
into an algorithm for the weighted case. Computational experiments with random
graphs show that this new algorithm in many cases is faster than earlier algorithms.
相关搜索： clique
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Ostergard_A New Algorithm for the Maximum-Weight Clique Problem.pdf