246 search results - page 2 / 50 » Dynamic Local Search for the Maximum Clique Problem |
180
Voted
CP
2003
Springer
15 years 11 months ago
2003
Springer
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
180
Voted
LION
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
124
Voted
NECO
2006
15 years 6 months ago
2006
165
Voted
WG
2004
Springer
15 years 11 months ago
2004
Springer
The clique problem consists in determining whether an undirected graph G of order n contains a clique of order . In this paper we are concerned with the decremental version of cliq...
202
Voted
CPM
2006
Springer
15 years 10 months ago
2006
Springer
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...