Graph unification and matching
From MaRDI portal
Recommendations
- Matching graphs
- The graph matching problem
- Combinatorial and matrix methods for graph matching
- Graph similarity scoring and matching
- Graph matching based on dot product representation of graphs
- Matching graphs with unique node labels
- Graph-Based Representations in Pattern Recognition
- scientific article; zbMATH DE number 2043366
Cites work
- An efficient incremental algorithm for solving systems of linear diophantine equations
- Efficient solution of linear diophantine equations
- Graph expressions and graph rewritings
- scientific article; zbMATH DE number 3827203 (Why is no real title available?)
- scientific article; zbMATH DE number 4049096 (Why is no real title available?)
- scientific article; zbMATH DE number 3633737 (Why is no real title available?)
- scientific article; zbMATH DE number 1231490 (Why is no real title available?)
- Hyperedge replacement: grammars and languages
- Linear unification
- Minimal and complete word unification
- THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
- The undecidability of the second-order unification problem
- Unification: a multidisciplinary survey
- Word unification and transformation of generalized equations
Cited in
(6)- Drags: a compositional algebraic framework for graph rewriting
- Unification of drags and confluence of drag rewriting
- Rational unification in 28 characters
- Matching and binding of m-conceptual graphs
- scientific article; zbMATH DE number 4072435 (Why is no real title available?)
- Solving equations by graph transformation
This page was built for publication: Graph unification and matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645268)
