1816 search results - page 2 / 364 » A New Approach for Solving the Maximum Clique Problem |
DAM
2006
14 years 11 months ago
2006
A new simple generalization of the Motzkin
82
Voted
IPPS
1998
IEEE
15 years 4 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...
122
click to vote
SIAMJO
2002
14 years 11 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 ...
122
click to vote
IOR
2011
14 years 6 months 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 ...
77
Voted
JAIR
2006
14 years 11 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...