6751
21
9842
5
28594
document
9842
pami2.pdf
application/pdf
65bf637e78cf6454468d8fc59cba5287
MD5
432317
20091215 10:47:25
http://cogprints.org/6751/1/pami2.pdf
6751
1
1
application/pdf
application/pdf
en
public
pami2.pdf
20091214
draft

http://eprints.org/relation/hasVolatileVersion
http://cogprints.org/id/document/9849

http://eprints.org/relation/hasVersion
http://cogprints.org/id/document/9849

http://eprints.org/relation/haspreviewThumbnailVersion
http://cogprints.org/id/document/9849

http://eprints.org/relation/hasVolatileVersion
http://cogprints.org/id/document/9850

http://eprints.org/relation/hasVersion
http://cogprints.org/id/document/9850

http://eprints.org/relation/hasIndexCodesVersion
http://cogprints.org/id/document/9850
archive
9653
disk0/00/00/67/51
20091219 11:47:59
20110311 08:57:34
20091219 11:47:59
preprint
show
0
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.

Jain
Brijnesh
jbj@cs.tuberlin.de
graph matching, maximum weight clique problem
TRUE
FALSE
 compsciartintel
A Necessary and Sufficient Condition for Graph Matching to be equivalent to Clique Search
published
20091215
public