The study introduces new heuristics to address the challenging Maximum Common Subgraph (MCS) problem by reformulating it as the Maximum Clique and its complement, the Maximum Independent Set. Leveraging the Motzkin-Straus theorem, replicator dynamics are used to optimize the Maximum Clique Problem. Annealed imitation heuristics are introduced to enhance convergence to better local optima. Additionally, strategies for the Maximum Independent Set problem are applied to efficiently reduce graph sizes, enabling faster computation and near-optimal solutions. The implementation of both techniques in a single algorithm shows promising results on Erd˝os-R´enyi graph pairs.
toiselle kielelle
lähdeaineistosta
arxiv.org
Tärkeimmät oivallukset
by Davide Guido... klo arxiv.org 03-14-2024
https://arxiv.org/pdf/2403.08703.pdfSyvällisempiä Kysymyksiä