<> "The repository administrator has not yet configured an RDF license."^^ .
<> .
.
"A Necessary and Sufficient Condition for Graph Matching to be equivalent to Clique Search"^^ .
"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;\r\nand 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."^^ .
"2009-12-15" .
.
.
.
.
.
.
"Brijnesh"^^ .
"Jain"^^ .
"Brijnesh Jain"^^ .
.
.
.
.
.
"A Necessary and Sufficient Condition for Graph Matching to be equivalent to Clique Search (PDF)"^^ .
.
.
.
.
.
.
.
.
.
.
"pami2.pdf"^^ .
.
.
"A Necessary and Sufficient Condition for Graph Matching to be equivalent to Clique Search (Image (JPEG))"^^ .
.
.
.
.
.
"preview.jpg"^^ .
.
.
"A Necessary and Sufficient Condition for Graph Matching to be equivalent to Clique Search (Indexer Terms)"^^ .
.
.
.
.
.
"indexcodes.txt"^^ .
.
"HTML Summary of #6751 \n\nA Necessary and Sufficient Condition for Graph Matching to be equivalent to Clique Search\n\n" .
"text/html" .
.
.
"Artificial Intelligence" .
.