Subgraph transformations for the inexact matching of attributed relational graphs
From MaRDI portal
Recommendations
Cited in
(17)- Kronecker product graph matching.
- A long trip in the charming world of graphs for pattern recognition
- An approach for approximate subgraph matching in fuzzy RDF graph
- Attributed relational graph matching based on the nested assignment structure
- Efficient Suboptimal Graph Isomorphism
- A Structural and Semantic Probabilistic Model for Matching and Representing a Set of Graphs
- A matching algorithm between precursory 3D process model and 2D working procedure drawing based on subgraph isomorphism
- Isomorphism between strong fuzzy relational graphs based on k-formulae
- scientific article; zbMATH DE number 1759531 (Why is no real title available?)
- Spatial Pattern Discovering by Learning the Isomorphic Subgraph from Multiple Attributed Relational Graphs
- Graph-Based Representations in Pattern Recognition
- Graph-Based Representations in Pattern Recognition
- Graph-Based Representations in Pattern Recognition
- Solving subgraph isomorphism problems with constraint programming
- Improving quantum computation by optimized qubit routing
- A convex relaxation bound for subgraph isomorphism
- Isomorphism identification of graphs: especially for the graphs of kinematic chains
This page was built for publication: Subgraph transformations for the inexact matching of attributed relational graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4218487)
