A Necessary and Sufficient Condition for Graph Matching Being Equivalent to the Maximum Weight Clique Problem

Details A Necessary and Sufficient Condition for Graph Matching Being Equivalent to the Maximum Weight Clique Problem A Necessary and Sufficient Condition for Graph Matching Being Equivalent to the Maximum Weight Clique Problem

2009-12-23

arxiv.org/abs/0912.4584v1

Computer Science

Artificial Intelligence

19 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Necessary and Sufficient Condition for Graph Matching Being Equivalent to the Maximum Weight Clique Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Necessary and Sufficient Condition for Graph Matching Being Equivalent to the Maximum Weight Clique Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Necessary and Sufficient Condition for Graph Matching Being Equivalent to the Maximum Weight Clique Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-362898