?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.title=A+Necessary+and+Sufficient+Condition+for+Graph+Matching+to+be+equivalent+to+Clique+Search&rft.creator=Jain%2C+Brijnesh&rft.subject=Artificial+Intelligence&rft.description=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%3A+first%2C+the+condition+is+general+enough+to+cover+a+broad+range+of+practical+graph+matching+problems%3B+second%2C+a+proof+to+establish+equivalence+between+graph+matching+and+clique+search+reduces+to+showing+that+a+given+graph+matching+problem+satisfies+the+proposed+condition%3B%0D%0Aand+third%2C+the+result+sets+the+scene+for+generic+continuous+solutions+for+a+broad+range+of+graph+matching+problems.+To+illustrate+the+mathematical+framework%2C+we+apply+it+to+a+number+of+graph+matching+problems%2C+including+the+problem+of+determining+the+graph+edit+distance.&rft.date=2009-12-15&rft.type=Preprint&rft.type=NonPeerReviewed&rft.format=application%2Fpdf&rft.identifier=http%3A%2F%2Fcogprints.org%2F6751%2F1%2Fpami2.pdf&rft.identifier=++Jain%2C+Brijnesh++(2009)+A+Necessary+and+Sufficient+Condition+for+Graph+Matching+to+be+equivalent+to+Clique+Search.++%5BPreprint%5D+++++&rft.relation=http%3A%2F%2Fcogprints.org%2F6751%2F