Pages that link to "Item:Q1357079"
From MaRDI portal
The following pages link to Algorithms for approximate graph matching (Q1357079):
Displaying 18 items.
- Fast processing of graph queries on a large database of small and medium-sized data graphs (Q295652) (← links)
- Using local similarity measures to efficiently address approximate graph matching (Q496650) (← links)
- Structural pattern recognition with graph edit distance. Approximation algorithms and applications (Q518686) (← links)
- Matching graphs with unique node labels (Q851709) (← links)
- An algorithm for weighted sub-graph matching based on gradient flows (Q1671710) (← links)
- Seeking affinity structure: strategies for improving \(m\)-best graph matching (Q1999054) (← links)
- On the complexity of approximately matching a string to a directed graph (Q2084771) (← links)
- Inexact graph matching using a hierarchy of matching processes (Q2288126) (← links)
- A fast projected fixed-point algorithm for large graph matching (Q2417841) (← links)
- The graph matching problem (Q2444585) (← links)
- Combinatorial and matrix methods for graph matching (Q2705574) (← links)
- Degree reduction in labeled graph retrieval (Q2828204) (← links)
- On the use of similarity metrics for approximate graph matching (Q2883637) (← links)
- (Q4786059) (← links)
- (Q5053318) (← links)
- (Q5276648) (← links)
- Combining Two Structured Domains for Modeling Various Graph Matching Problems (Q5302726) (← links)
- Finding approximate patterns in undirected acyclic graphs (Q5959618) (← links)