Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: (1, k)-Swap Local Search for Maximum Clique Problem   Given simple undirected graph G = (V, E), the Maximum Clique Problem(MCP) is
that of finding a maximum-cardinality subset Q of V such that any two vertices
in Q are adjacent. We present a modified local search algorithm for this
problem. Our algorithm build some maximal solution and can determine in
polynomial time if a maximal solution can be improved by replacing a single
vertex with k, k > 1, others. We test our algorithms on DIMACS[5], Sloane[15],
BHOSLIB[1], Iovanella[8] and our random instances.

30
The categories of this paper are: q-alg
13
The categories of this paper are: quant-ph
24
The categories of this paper are: dg-ga
33
The categories of this paper are: plasm-ph
16
The categories of this paper are: stat
19
The categories of this paper are: eess
32
The categories of this paper are: atom-ph
29
The categories of this paper are: funct-an
5
The categories of this paper are: gr-qc
31
The categories of this paper are: ao-sci
11
The categories of this paper are: hep-lat
4
The categories of this paper are: cond-mat
14
The categories of this paper are: math-ph
25
The categories of this paper are: patt-sol
21
The categories of this paper are: adap-org
12
The categories of this paper are: nucl-th