✦ LIBER ✦

A survey of graph edit distance

✍ Scribed by Xinbo Gao; Bing Xiao; Dacheng Tao; Xuelong Li

Book ID: 106256465
Publisher: Springer-Verlag
Year: 2009
Tongue: English
Weight: 541 KB
Volume: 13
Category: Article
ISSN: 1433-7541
DOI: 10.1007/s10044-008-0141-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

HMM-based graph edit distance for image

HMM-based graph edit distance for image indexing

✍ Bing Xiao; Xinbo Gao; Dacheng Tao; Xuelong Li 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 386 KB 👁 1 views

## Abstract Most of the existing graph edit distance (GED) algorithms require cost functions which are difficult to be defined exactly. In this article, we propose a cost function free algorithm for computing GED. It only depends on the distribution of nodes rather than node or edge attributes in g

The maximum edit distance from hereditar

The maximum edit distance from hereditary graph properties

✍ Noga Alon; Uri Stav 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 285 KB

A survey on tree edit distance and relat

A survey on tree edit distance and related problems

✍ Philip Bille 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 314 KB

On a relation between graph edit distanc

On a relation between graph edit distance and maximum common subgraph

✍ H. Bunke 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 365 KB

A survey on the distance-colouring of gr

A survey on the distance-colouring of graphs

✍ Florica Kramer; Horst Kramer 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 137 KB

A metric normalization of tree edit dist

A metric normalization of tree edit distance

✍ Li, Yujian ;Chenguang, Zhang 📂 Article 📅 2011 🏛 Higher Education Press and Springer 🌐 English ⚖ 180 KB