Sciweavers

SIAMJO
2002
142views more  SIAMJO 2002»
13 years 11 months ago
A Complementary Pivoting Approach to the Maximum Weight Clique Problem
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
Alessio Massaro, Marcello Pelillo, Immanuel M. Bom...
DAM
2006
87views more  DAM 2006»
13 years 11 months ago
A new trust region technique for the maximum weight clique problem
A new simple generalization of the Motzkin
Stanislav Busygin