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.