A parametric filtering algorithm for the graph isomorphism problem - Archive ouverte HAL Access content directly
Journal Articles Constraints Year : 2008

A parametric filtering algorithm for the graph isomorphism problem

Abstract

We introduce a new filtering algorithm, called IDL(d)-filtering, for a global constraint dedicated to the graph isomorphism problem ---the goal of which is to decide if two given graphs have an identical structure. The basic idea of IDL(d)-filtering is to label every vertex with respect to its relationships with other vertices around it in the graph, and to use these labels to filter domains by removing values that have different labels. IDL(d)-filtering is parameterized by a positive integer value d which gives a limit on the distance between a vertex to be labelled and the set of vertices considered to build its label. We experimentally compare different instantiations of IDL(d)-filtering with state-of-the-art dedicated algorithms and show that IDL(d)-filtering is more efficient on regular sparse graphs and competitive on other kinds of graphs.
Fichier principal
Vignette du fichier
constraints.pdf (288.08 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01500328 , version 1 (25-03-2020)

Identifiers

Cite

Sébastien Sorlin, Christine Solnon. A parametric filtering algorithm for the graph isomorphism problem. Constraints, 2008, 4, 13, pp.518-537. ⟨10.1007/s10601-008-9044-1⟩. ⟨hal-01500328⟩
146 View
73 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More