Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs
DOI10.7155/JGAA.00139zbMATH Open1161.68846OpenAlexW2168933917WikidataQ115926079 ScholiaQ115926079MaRDI QIDQ5301407FDOQ5301407
Authors: Donatello Conte, Pasquale Foggia, Mario Vento 
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
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Nonnumerical algorithms (68W05) Database theory (68P15)
Cited In (14)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An algorithm for maximum common subgraph of planar triangulation graphs
- Heuristics for the generalized median graph problem
- Answering ``why empty? and ``why so many? queries in graph databases
- A fast discovery algorithm for large common connected induced subgraphs
- Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
- Graph-Based Representations in Pattern Recognition
- Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem
- Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms
- Video indexing and similarity retrieval by largest common subgraph detection using decision trees
- Isomorphism testing via polynomial-time graph extensions
- An appraisal of the performance of the MMSC subgraph generation algorithm on a Cyber system 170/720
- Median graphs: A genetic approach based on new theoretical properties
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301407)
