Efficient parallel branch-and-bound approaches for exact graph edit distance problem-Reference-Cited by-同舟云学术

Efficient parallel branch-and-bound approaches for exact graph edit distance problem

Published:2022-12 Issue: Volume:114 Page:102984
ISSN:0167-8191
Container-title:Parallel Computing
language:en
Short-container-title:Parallel Computing

Author:

Dabah Adel,Chegrane Ibrahim^ORCID,Yahiaoui Saïd^ORCID,Bendjoudi Ahcene,Nouali-Taboudjemat Nadia

Funder

Direction Générale de la Recherche Scientifique et du Développement Technologique

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference39 articles.

1. Inexact graph matching for structural pattern recognition;Bunke;Pattern Recognit. Lett.,1983

2. Comparing stars: On approximating graph edit distance;Zeng;Proc. VLDB Endow.,2009

3. Structural Pattern Recognition with Graph Edit Distance: Approximation Algorithms and Applications;Riesen,2016

4. K. Riesen, S. Fankhauser, H. Bunke, Speeding Up Graph Edit Distance Computation with a Bipartite Heuristic, in: MLG, 2007.

5. Approximate graph edit distance computation by means of bipartite graph matching;Riesen;Image Vis. Comput.,2009

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

1. Speedup and efficiency of computational parallelization: A unifying approach and asymptotic analysis;Journal of Parallel and Distributed Computing;2024-05

2. Data, language and graph-based reasoning methods for identification of human malicious behaviors in nuclear security;Expert Systems with Applications;2024-02