A local branching heuristic for solving a Graph Edit Distance Problem-Reference-Cited by-同舟云学术

A local branching heuristic for solving a Graph Edit Distance Problem

Published:2019-06 Issue: Volume:106 Page:225-235
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Darwiche Mostafa,Conte Donatello^ORCID,Raveaux Romain,T’Kindt Vincent

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modelling and Simulation,General Computer Science

Reference23 articles.

1. A graph database repository and performance evaluation metrics for graph edit distance;Abu-Aisheh,2015

2. Bougleux, S., Brun, L., Carletti, V., Foggia, P., Gaüzère, B., Vento, M., 2015. A quadratic assignment formulation of the graph edit distance. arXiv preprint arXiv:1512.07494.

3. Graph edit distance as a quadratic assignment problem;Bougleux;Pattern Recognit. Lett.,2017

4. Brun, L., 2016. Greyc’s chemistry dataset. https://brunl01.users.greyc.fr/CHEMISTRY/.

5. On a relation between graph edit distance and maximum common subgraph;Bunke;Pattern Recognit. Lett.,1997

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

1. Graphs in pattern recognition: successes, shortcomings, and perspectives;Journal of Electronic Imaging;2023-03-23

2. AN ALGORITHM FOR GARBAGE TRUCK ROUTING IN CITIES WITH A FIXATION ON CONTAINER FILLING LEVEL;Transport Problems;2023-03-01

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

4. Graph based Method for Online Handwritten Character Recognition;Proceedings of the 15th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications;2020

5. Fast Similarity Search for Graphs by Edit Distance;Cybernetics and Systems Analysis;2019-11