✦ 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
DOI: 10.1016/j.patrec.2009.10.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A POCS-based graph matching algorithm

✍ van Wyk, B.J.; van Wyk, M.A. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 285 KB

A RKHS interpolator-based graph matching

A RKHS interpolator-based graph matching algorithm

✍ van Wyk, M.A.; Durrani, T.S.; van Wyk, B.J. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 696 KB

A multigrid method based on graph matchi

A multigrid method based on graph matching for convection–diffusion equations

✍ HwanHo Kim; Jinchao Xu; Ludmil Zikatanov 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB

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.

Attributed relational graph matching bas

Attributed relational graph matching based on the nested assignment structure

✍ Duck Hoon Kim; Il Dong Yun; Sang Uk Lee 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 824 KB

Covering a Graph by Forests and a Matchi

Covering a Graph by Forests and a Matching

✍ Kaiser, Tomáš; Montassier, Mickaël; Raspaud, André 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 161 KB