2022.03.05
graph homomorphism (inexact)
isomorphism (exact)
bijective 一一对应
- exact match
- inexact match
博士论文得对后人有用， 能够让大领域（计算机领域）的人看的懂。 intro成为本领域的primer
fitness function描述边和线之间的相似度。
2.2.2 Graph matching using dummy vertices
[Finch et al., 1998b]
2.4
[Jolion and Kropatsch, 1998, Kropatsch and Jolion, 1999, Jolion et al., 2001] works on practically all as- pects discussed on this chapter
2.4.2 Distance measures, conceptual graphs, and graph edit distances and metrics
⭐[Fernandez and Valiente, 2001] proposes a way of representing attributed relational graphs, the maximum common subgraph and the minimum common supergraph of two graphs by means of simple constructions