Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs

DOI10.7155/jgaa.00139zbMath1161.68846OpenAlexW2168933917WikidataQ115926079 ScholiaQ115926079MaRDI QIDQ5301407

Pasquale Foggia, Mario Vento, Donatello Conte

Publication date: 19 January 2009

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/55424

zbMATH Keywords

graph matching algorithms

Mathematics Subject Classification ID

Database theory (68P15) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (6)

Heuristics for the generalized median graph problem ⋮ Answering ``why empty? and ``why so many? queries in graph databases ⋮ Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem ⋮ Isomorphism testing via polynomial-time graph extensions ⋮ Median graphs: A genetic approach based on new theoretical properties ⋮ A fast discovery algorithm for large common connected induced subgraphs

This page was built for publication: Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs