GEDLIB: A C++ Library for Graph Edit Distance Computation-Reference-Cited by-同舟云学术

GEDLIB: A C++ Library for Graph Edit Distance Computation

Published:2019 Issue: Volume: Page:14-24
ISSN:0302-9743
Container-title:Graph-Based Representations in Pattern Recognition
language:
Short-container-title:

Author:

Blumenthal David B.^ORCID,Bougleux Sébastien^ORCID,Gamper Johann^ORCID,Brun Luc^ORCID

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-20081-7_2

Reference32 articles.

1. Lecture Notes in Computer Science;Z Abu-Aisheh,2015

2. Blumenthal, D.B., Gamper, J.: Improved lower bounds for graph edit distance. IEEE Trans. Knowl. Data Eng. 30(3), 503–516 (2018). https://doi.org/10.1109/TKDE.2017.2772243

3. Lecture Notes in Computer Science;DB Blumenthal,2018

4. Blumenthal, D.B., Bougleux, S., Gamper, J., Brun, L.: Upper bounding GED via transformations to LSAPE based on rings and machine learning (2018, submitted)

5. Blumenthal, D.B., Daller, E., Bougleux, S., Brun, L., Gamper, J.: Quasimetric graph edit distance as a compact quadratic assignment problem. In: ICPR 2018, pp. 934–939 (2018)

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

1. Network medicine-based epistasis detection in complex diseases: ready for quantum computing;Nucleic Acids Research;2024-08-23

2. Network medicine-based epistasis detection in complex diseases: ready for quantum computing;2023-11-09

3. Frequent Generalized Subgraph Mining via Graph Edit Distances;Communications in Computer and Information Science;2023

4. Efficient parallel branch-and-bound approaches for exact graph edit distance problem;Parallel Computing;2022-12

5. A Study on the Stability of Graph Edit Distance Heuristics;Electronics;2022-10-14