𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A graph matching method and a graph matching distance based on subgraph assignments

✍ Scribed by Romain Raveaux; Jean-Christophe Burie; Jean-Marc Ogier


Book ID
108235980
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
1003 KB
Volume
31
Category
Article
ISSN
0167-8655

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Graph similarity scoring and matching
✍ Laura A. Zager; George C. Verghese πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 601 KB

We outline a class of graph similarity measures that uses the structural similarity of local neighborhoods to derive pairwise similarity scores for the nodes of two different graphs, and present a related similarity measure that uses a linear update to generate both node and edge similarity scores.

Covering a Graph by Forests and a Matchi
✍ Kaiser, TomΓ‘Ε‘; Montassier, MickaΓ«l; Raspaud, AndrΓ© πŸ“‚ Article πŸ“… 2011 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 161 KB