57 search results - page 1 / 12 » A new approach to the planted clique problem |
FSTTCS
2008
Springer
13 years 6 months ago
2008
Springer
AAIM
2006
Springer
13 years 11 months ago
2006
Springer
CP
2003
Springer
13 years 10 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...
COCOON
2005
Springer
13 years 7 months ago
2005
Springer
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...
ICDCS
1998
IEEE
13 years 9 months ago
1998
IEEE
This paper considers the problem of key agreement in a group setting with highly-dynamic group member population. A protocol suite, called CLIQUES, is developed by extending the w...