A comparison of three maximum common subgraph algorithms on a large database of labeled graphs
From MaRDI portal
Recommendations
- A comparison of algorithms for maximum common subgraph on randomly connected graphs
- Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs
- A new approach and faster exact methods for the maximum common subgraph problem
- scientific article; zbMATH DE number 15858
- scientific article; zbMATH DE number 1472113
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?)
- Generalization of two hypergraphs. Algorithm of calculation of the greatest sub-hypergraph common to two hypergraphs annotated by semantic information
- Matching of chemical and biological structures using subgraph and maximal common subgraph isomorphism algorithms
- RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs
- A comparison of algorithms for maximum common subgraph on randomly connected graphs
- 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
- A direct algorithm to find a largest common connected induced subgraph of two graphs
- From exact to approximate maximum common subgraph
- A new approach and faster exact methods for the maximum common subgraph problem
- Matching graphs with unique node labels
This page was built for publication: A comparison of three maximum common subgraph algorithms on a large database of labeled graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4450798)