A novel edge-centric approach for graph edit similarity computation-Reference-Cited by-同舟云学术

A novel edge-centric approach for graph edit similarity computation

Author:

Gouda Karam,Hassaan Mosab

Publisher

Elsevier BV

Subject

Hardware and Architecture,Information Systems,Software

Reference39 articles.

1. Thirty years of graph matching in pattern recognition;Conte;Int. J. Pattern Recognit. Artif. Intell.,2004

2. Nema: Fast graph search with label similarity;Khan;PVLDB,2013

3. Complete and accurate clone detection in graph-based models;Pham,2009

5. Similarity flooding: A versatile graph matching algorithm and its application to schema matching;Melnik,2002

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

1. A Novel Two-Stage Directed Graph Similarity Determination Algorithm;2022 IEEE 4th International Conference on Civil Aviation Safety and Information Technology (ICCASIT);2022-10-12

3. Boosting Graph Similarity Search through Pre-Computation;Proceedings of the 2021 International Conference on Management of Data;2021-06-09

4. An Approximation Method for Large Graph Similarity;2020 IEEE International Conference on Big Data (Big Data);2020-12-10