Inexact Correspondence Between Graphs
Mostrando 1-1 de 1 artigos, teses e dissertações.
-
1. inexact graph correspondence / Correspondência inexata entre grafos.
Let GI = (VI ,AI) and GM = (VM,AM) be two simple graphs. A mapping from GI to GM is an association set, such that each vertex in VI is associated to a vertex in VM, and each edge in AI is associated to a pair of vertices of VM. A cost is defined to each possible association. The inexact graph correspondence problem (IGCP) consists in finding a mapping from G
Publicado em: 2008