scientific article; zbMATH DE number 2090205
From MaRDI portal
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
Cited in
(19)- scientific article; zbMATH DE number 2043361 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 7380509 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 842879 (Why is no real title available?)
- The journey of graph kernels through two decades
- Graph-Based Representations in Pattern Recognition
- A branch \& cut algorithm for the maximum common edge subgraph problem
- Graph-Based Representations in Pattern Recognition
- 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)
