11 search results - page 1 / 3 » Payoff-Monotonic Game Dynamics and the Maximum Clique Proble... |
NECO
2006
13 years 4 months ago
2006
JAIR
2006
13 years 4 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...
ICPR
2000
IEEE
14 years 5 months ago
2000
IEEE
The matching of hierarchical relational structures is of significant interest in computer vision and pattern recognition. We have recently introduced a new solution to this proble...
EMMCVPR
2001
Springer
13 years 9 months ago
2001
Springer
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
LION
2007
Springer
13 years 11 months 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...