1816 search results - page 2 / 364 » A New Approach for Solving the Maximum Clique Problem |
DAM
2006
13 years 5 months ago
2006
A new simple generalization of the Motzkin
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
Given an (undirected) graph G = V; E; a clique of G is a subset of vertices in which every pair is connected by an edge. The problem of finding a clique of maximum size is a class...
SIAMJO
2002
13 years 5 months ago
2002
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 ...
IOR
2011
13 years 7 days ago
2011
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
JAIR
2006
13 years 5 months ago
2006
In this paper, we introduce DLS-MC, a new stochastic local search algorithm for the maximum clique problem. DLS-MC alternates between phases of iterative improvement, during which...