November 16, 2016

ARG Database

The dataset

The ARG Database is a huge collection of labeled and unlabeled graphs realized by the MIVIA Group. The aim of this collection is to provide the graph research community with a standard test ground for the benchmarking of graph matching algorithms.The database is organized in two section: labeled and unlabeled graphs.
Both labeled and unlabeled graphs have been randomly generated according to six different generation models, each involving different possible parameter settings. As a result, 168 diverse kinds of graphs are contained in the database. Each type of unlabeled graph is represented by thousands of pairs of graphs for which an isomorphism or a graph-subgraph isomorphism relation holds, for a total of 143,600 graphs. Furthermore, each type of labeled graph is represented by thousands of pairs of graphs holding a not trivial common subgraph, for a total of 166,000 graphs.
Some useful information about the dataset, including some usage examples, can be downloaded here.


Download

The whole dataset (for both the isomorphism and subgraph isomorphism parts and for the minimum common subgraph part) can be downloaded by requesting it at this link, while at this link you can find the graph generator software.


Documentation

More information about the use of the ARG Database and about the graph generator software can be found here.


References

If you use this dataset please cite:

  • A large database of graphs and its use for benchmarking graph isomorphism algorithms
  • A Database of Graphs for Isomorphism and Sub-Graph Isomorphism Benchmarking

Other reference papers are:

Useful papers are:

  • Thirty years of graph matching in pattern recognition

    A recent paper posed the question: “Graph Matching: What are we really talking about?”. Far from providing a definite answer to that question, in this paper we will try to characterize the role that graphs play within the Pattern Recognition field. To this aim two taxonomies are presented and discussed. The first includes almost all the graph matching algorithms proposed from the late seventies, and describes the different classes of algorithms. The second taxonomy considers the types of common applications of graph-based techniques in the Pattern Recognition and Machine Vision field.

  • Graph-Based Methods in Computer Vision: Developments and Applications

    Many computer vision applications require a comparison between two objects, or between an object and a reference model. When the objects or the scenes are represented by graphs, this comparison can be performed using some form of graph matching. The aim of this chapter is to introduce the main graph matching techniques that have been used for computer vision, and to relate each application with the techniques that are most suited to it.


Help

If you have any problems, do not hesitate to contact us here.