From exact to approximate maximum common subgraph
From MaRDI portal
Recommendations
- An algorithm for maximum common subgraph of planar triangulation graphs
- A comparison of three maximum common subgraph algorithms on a large database of labeled graphs
- Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs
- On the use of similarity metrics for approximate graph matching
- A comparison of algorithms for maximum common subgraph on randomly connected graphs
Cited in
(2)
This page was built for publication: From exact to approximate maximum common subgraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5316471)