Graph Homomorphism Revisited for Graph Matching图同态重新图匹配.pptVIP

Graph Homomorphism Revisited for Graph Matching --VLDB’10 报告人：洪骥 2010-11-9 Abstract (1) We propose p-homomorphism (p-hom) and 1-1 p-hom, which extend graph homomorphism and subgraph isomorphism, respectively, by mapping edges from one graph to paths in another, and by measuring the similarity of nodes. (2) We introduce metrics to measure graph similarity, and several optimization problems for p-hom and 1-1 p-hom. (3) We show that the decision problems for p-hom and 1-1 p-hom are NP-complete even for DAGs, and that the optimization problems are approximation-hard. (4) Nevertheless, we provid