Algorithms for approximate graph matching
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3825216 (Why is no real title available?)
- scientific article; zbMATH DE number 51444 (Why is no real title available?)
- scientific article; zbMATH DE number 53191 (Why is no real title available?)
- scientific article; zbMATH DE number 65738 (Why is no real title available?)
- scientific article; zbMATH DE number 3481857 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1516705 (Why is no real title available?)
- A Tree-Matching Algorithm Based on Node Splitting and Merging
- An Algorithm for Subgraph Isomorphism
- An Improved Algorithm For Approximate String Matching
- Approximate Tree Matching in the Presence of Variable Length Don′t Cares
- Approximate matching of regular expressions
- Exact and approximate algorithms for unordered tree matching
- Fast algorithms for the unit cost editing distance between trees
- Fast parallel and serial approximate string matching
- Finding approximate patterns in strings
- On the editing distance between unordered labeled trees
- Optimization by simulated annealing
- Pattern matching in a digitized image
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- The Noisy Substring Matching Problem
- The String-to-String Correction Problem
- The Tree-to-Tree Correction Problem
- The theory and computation of evolutionary distances: Pattern recognition
Cited in
(25)- Using local similarity measures to efficiently address approximate graph matching
- scientific article; zbMATH DE number 6746354 (Why is no real title available?)
- Node matching computation between two large graphs in linear computational cost
- Approximate graph isomorphism
- Degree reduction in labeled graph retrieval
- On the complexity of approximately matching a string to a directed graph
- scientific article; zbMATH DE number 7626795 (Why is no real title available?)
- Complexity issues of string to graph approximate matching
- Combinatorial and matrix methods for graph matching
- Combining Two Structured Domains for Modeling Various Graph Matching Problems
- Inexact graph matching using a hierarchy of matching processes
- scientific article; zbMATH DE number 2043360 (Why is no real title available?)
- Matching graphs with unique node labels
- Finding approximate patterns in undirected acyclic graphs
- Distance patterns in structural similarity
- An algorithm for weighted sub-graph matching based on gradient flows
- scientific article; zbMATH DE number 2097443 (Why is no real title available?)
- Approximate matching of neighborhood subgraphs -- an ordered string graph Levenshtein method
- Structural pattern recognition with graph edit distance. Approximation algorithms and applications
- scientific article; zbMATH DE number 1844618 (Why is no real title available?)
- On the use of similarity metrics for approximate graph matching
- The graph matching problem
- A fast projected fixed-point algorithm for large graph matching
- Fast processing of graph queries on a large database of small and medium-sized data graphs
- Seeking affinity structure: strategies for improving \(m\)-best graph matching
This page was built for publication: Algorithms for approximate graph matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1357079)
