This site has been permanently archived. This is a static copy provided by the University of Southampton.
--- abstract: "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." altloc: [] chapter: ~ commentary: ~ commref: ~ confdates: ~ conference: ~ confloc: ~ contact_email: ~ creators_id: - jbj@cs.tu-berlin.de creators_name: - family: Jain given: Brijnesh honourific: '' lineage: '' date: 2009-12-15 date_type: published datestamp: 2009-12-19 11:47:59 department: ~ dir: disk0/00/00/67/51 edit_lock_since: ~ edit_lock_until: ~ edit_lock_user: ~ editors_id: [] editors_name: [] eprint_status: archive eprintid: 6751 fileinfo: /style/images/fileicons/application_pdf.png;/6751/1/pami2.pdf full_text_status: public importid: ~ institution: ~ isbn: ~ ispublished: ~ issn: ~ item_issues_comment: [] item_issues_count: 0 item_issues_description: [] item_issues_id: [] item_issues_reported_by: [] item_issues_resolved_by: [] item_issues_status: [] item_issues_timestamp: [] item_issues_type: [] keywords: 'graph matching, maximum weight clique problem' lastmod: 2011-03-11 08:57:34 latitude: ~ longitude: ~ metadata_visibility: show note: ~ number: ~ pagerange: ~ pubdom: TRUE publication: ~ publisher: ~ refereed: FALSE referencetext: ~ relation_type: [] relation_uri: [] reportno: ~ rev_number: 21 series: ~ source: ~ status_changed: 2009-12-19 11:47:59 subjects: - comp-sci-art-intel succeeds: ~ suggestions: ~ sword_depositor: ~ sword_slug: ~ thesistype: ~ title: A Necessary and Sufficient Condition for Graph Matching to be equivalent to Clique Search type: preprint userid: 9653 volume: ~