Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Necessary and Sufficient Condition for Graph Matching Being Equivalent
  to the Maximum Weight Clique Problem   This paper formulates a necessary and sufficient condition for a generic
graph matching problem to be equivalent to the maximum vertex and edge weight
clique problem in a derived association graph. The consequences of this results
are threefold: first, the condition is general enough to cover a broad range of
practical graph matching problems; second, a proof to establish equivalence
between graph matching and clique search reduces to showing that a given graph
matching problem satisfies the proposed condition; and third, the result sets
the scene for generic continuous solutions for a broad range of graph matching
problems. To illustrate the mathematical framework, we apply it to a number of
graph matching problems, including the problem of determining the graph edit
distance.

37
The categories of this paper are: supr-con
35
The categories of this paper are: mtrl-th
22
The categories of this paper are: chao-dyn
19
The categories of this paper are: eess
3
The categories of this paper are: physics
30
The categories of this paper are: q-alg
13
The categories of this paper are: quant-ph
21
The categories of this paper are: adap-org
12
The categories of this paper are: nucl-th
28
The categories of this paper are: alg-geom
29
The categories of this paper are: funct-an
27
The categories of this paper are: comp-gas
5
The categories of this paper are: gr-qc
25
The categories of this paper are: patt-sol
10
The categories of this paper are: q-bio
8
The categories of this paper are: hep-ex