Comprehensive Evaluation of Algorithms for Unrestricted Graph Alignment

Konstantinos Skitsas, Karol Orlowski, Judith Hermanns, Davide Mottin, Panagiotis Karras

EDBT 2023

TL;DR

Comprehensive becnhmark evaluation of graph alignment algorithms on general graphs. Our benchmark includes:

First, complete, experimental evaluation of nine undirected, unattributed graph alignment algorithms.
Carefully tuning of the algorithms hyperparameters based on network size and using the same assignment algorithm.
Thorough evaluation of the algorithms on real and synthetic graphs, with different levels and types of noise.
Memory and time scalability experiments on the algorithms.
An experimental framework for graph alignment with reproducible experiments and available data and code.

Want to know more on which algorithm is best to choose? Check the image below and skim the paper! Any feedback is appreciated.