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

DOI10.1016/S0167-8655(02)00253-2zbMath1028.68040WikidataQ57938631 ScholiaQ57938631MaRDI QIDQ4417659

Carlo Sansone, Pasquale Foggia, Mario Vento, Massimo De Santo

Publication date: 29 July 2003

Published in: Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8655(02)00253-2

zbMATH Keywords

Benchmarking; Graph isomorphism; Exact graph matching; Graph database

Mathematics Subject Classification ID

68P15: Database theory

68R10: Graph theory (including graph drawing) in computer science

Related Items

A general system for heuristic minimization of convex functions over non-convex sets, Formulations for the maximum common edge subgraph problem, Polynomial algorithms for open plane graph and subgraph isomorphisms, \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions, Solving subgraph isomorphism problems with constraint programming, Isomorphism testing via polynomial-time graph extensions, Integer sequence discovery from small graphs, A long trip in the charming world of graphs for pattern recognition, Efficient subgraph matching using topological node feature constraints, Generalized median graphs and applications, Novel techniques to speed up the computation of the automorphism group of a graph

Uses Software

• VFLib