scientific article; zbMATH DE number 2090205
From MaRDI portal
Publication:4808935
zbMATH Open1073.68700MaRDI QIDQ4808935FDOQ4808935
Authors: Pasquale Foggia, C. Guidobaldi, Carlo Sansone, Mario Vento, Horst Bunke 
Publication date: 12 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2396/23960123.htm
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 2043361
- Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs
- Computing and Combinatorics
- Graph-Based Representations in Pattern Recognition
- scientific article; zbMATH DE number 15858
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
Cited In (19)
- Title not available (Why is that?)
- Metric for comparison of graph-theoretic models of the same dimension with ordered vertices
- Observations from parallelising three maximum common (connected) subgraph algorithms
- Cost and accuracy aware scientific workflow retrieval based on distance measure
- Title not available (Why is that?)
- Maximum common induced subgraph parameterized by vertex cover
- Heuristics for the generalized median graph problem
- Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs
- Title not available (Why is that?)
- The journey of graph kernels through two decades
- Graph-Based Representations in Pattern Recognition
- Graph-Based Representations in Pattern Recognition
- A branch \& cut algorithm for the maximum common edge subgraph problem
- On the minimum common supergraph of two graphs
- RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs
- Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms
- Computing and Combinatorics
- Median graphs: A genetic approach based on new theoretical properties
- Enumerating all connected maximal common subgraphs in two graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4808935)
