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

DOI10.1016/S0167-8655(02)00253-2zbMath1028.68040OpenAlexW2143387021WikidataQ57938631 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

BenchmarkingGraph isomorphismExact graph matchingGraph database

Mathematics Subject Classification ID

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

Related Items (11)

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

Uses Software

• VFLib

This page was built for publication: A large database of graphs and its use for benchmarking graph isomorphism algorithms