scientific article; zbMATH DE number 2043361
From MaRDI portal
Publication:4450798
Recommendations
Cited in
(18)- Observations from parallelising three maximum common (connected) subgraph algorithms
- Polyhedral study of the maximum common induced subgraph problem
- Video indexing and similarity retrieval by largest common subgraph detection using decision trees
- Degree reduction in labeled graph retrieval
- Subgraphs as a measure of similarity
- scientific article; zbMATH DE number 4081609 (Why is no real title available?)
- scientific article; zbMATH DE number 1222890 (Why is no real title available?)
- scientific article; zbMATH DE number 1335845 (Why is no real title available?)
- RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs
- scientific article; zbMATH DE number 2090205 (Why is no real title available?)
- scientific article; zbMATH DE number 842879 (Why is no real title available?)
- An algorithm for maximum common subgraph of planar triangulation graphs
- An improved maximum common induced subgraph solver
- Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs
- Graph-Based Representations in Pattern Recognition
- Graph-Based Representations in Pattern Recognition
- Computing and Combinatorics
- Matching graphs with unique node labels
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 Q4450798)