Personal tools
You are here: Home Events Lab lunch speakers 2010 Yinghui Wu

Yinghui Wu

Homomorphism and Simulation Revised for Graph Matching

Graph matching is important in emerging applications. Traditional graph matching are mostly defined in terms of graph homomorphism and subgraph isomorphism, which are intractable while falling short of capturing graph similarity among real life graphs. In this lab lunch talk I will introduce graph matching and corresponding solutions based on revisions of homomorphism and simulation, which (1) have less computational complexity (from intractable to PTIME), and (2) can find more effective results capturing real life graph similarity.

Document Actions