Algorithms for approximate graph matching
From MaRDI portal
Publication:1357079
DOI10.1016/0020-0255(94)00057-IzbMath0878.68096OpenAlexW1983377546MaRDI QIDQ1357079
Gung-Wei Chirn, Zhang, Kaizhong, Wang, Jason T. L.
Publication date: 16 June 1997
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(94)00057-i
Related Items (2)
Fast processing of graph queries on a large database of small and medium-sized data graphs ⋮ Combining Two Structured Domains for Modeling Various Graph Matching Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Approximate matching of regular expressions
- On the editing distance between unordered labeled trees
- Pattern matching in a digitized image
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- A Tree-Matching Algorithm Based on Node Splitting and Merging
- An Improved Algorithm For Approximate String Matching
- Finding approximate patterns in strings
- The theory and computation of evolutionary distances: Pattern recognition
- An Algorithm for Subgraph Isomorphism
- The Tree-to-Tree Correction Problem
- Fast parallel and serial approximate string matching
- Approximate Tree Matching in the Presence of Variable Length Don′t Cares
- The String-to-String Correction Problem
- The Noisy Substring Matching Problem
- Exact and approximate algorithms for unordered tree matching
- Fast algorithms for the unit cost editing distance between trees
This page was built for publication: Algorithms for approximate graph matching
