A large database of graphs and its use for benchmarking graph isomorphism algorithms-Reference-Cited by-同舟云学术

A large database of graphs and its use for benchmarking graph isomorphism algorithms

Published:2003-05 Issue:8 Volume:24 Page:1067-1079
ISSN:0167-8655
Container-title:Pattern Recognition Letters
language:en
Short-container-title:Pattern Recognition Letters

Author:

De Santo M.,Foggia P.,Sansone C.,Vento M.

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Vision and Pattern Recognition,Signal Processing,Software

Reference20 articles.

1. A graph isomorphism algorithm for object recognition;Abdulrahim;Pattern Anal. Appl.,1998

2. Efficient attributed graph matching and its application to image analysis;Bunke,1995

3. Bunke, H., Vento, M. 1999. Benchmarking of graph matching algorithms. In: Proceedings of the 2nd Workshop on Graph-based Representations. Haindorf, pp. 109–114

4. Structural matching in computer vision using probabilistic relaxation;Christmas;IEEE Trans. Pattern Anal. Mach. Intell.,1995

5. Subgraph Transformations for the inexact matching of attributed relational graphs;Cordella;Comput. Suppl.,1998

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

1. Formulations for the maximum common edge subgraph problem;Discrete Applied Mathematics;2024-03

2. Network comparison via encoding, decoding, and causality;Physical Review Research;2023-08-24

3. The Multi-Maximum and Quasi-Maximum Common Subgraph Problem;Computation;2023-03-27

4. Some Consistency Rules for Graph Matching;SN Computer Science;2021-12-29

5. A Backtracking Algorithmic Toolbox for Solving the Subgraph Isomorphism Problem;Advances in Systems Analysis, Software Engineering, and High Performance Computing;2021