A Graph Database Repository and Performance Evaluation Metrics for Graph Edit Distance-Reference-Cited by-同舟云学术

A Graph Database Repository and Performance Evaluation Metrics for Graph Edit Distance

Published:2015 Issue: Volume: Page:138-147
ISSN:0302-9743
Container-title:Graph-Based Representations in Pattern Recognition
language:
Short-container-title:

Author:

Abu-Aisheh Zeina,Raveaux Romain,Ramel Jean-Yves

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-18224-7_14

Reference21 articles.

1. Vento, M.: A long trip in the charming world of graphs for pattern recognition. Pattern Recognition 48(2), 291–301 (2015)

2. Sorlin, S., Solnon, C., Michel Jolion, J.: A generic graph distance measure based on multivalent matchings (2007)

3. Sanfeliu, A., Fu, K.: A distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on S, M, and C 13, 353–362 (1983)

4. Bunke, H.: Inexact graph matching for structural pattern recognition. Pattern Recognition Letters 1(4), 245–253 (1983)

5. Lecture Notes in Computer Science;S. Fankhauser,2011

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Scalable generalized median graph estimation and its manifold use in bioinformatics, clustering, classification, and indexing;Information Systems;2021-09

2. Graph edit distance: Accuracy of local branching from an application point of view;Pattern Recognition Letters;2020-06

3. Comparing heuristics for graph edit distance computation;The VLDB Journal;2019-07-15

4. A local branching heuristic for solving a Graph Edit Distance Problem;Computers & Operations Research;2019-06

5. GEDLIB: A C++ Library for Graph Edit Distance Computation;Graph-Based Representations in Pattern Recognition;2019