Algorithms for approximate graph matching
type: Item
instance of: scholarly article
title: Algorithms for approximate graph matching
zbMATH Open document ID: 0878.68096
DOI: 10.1016/0020-0255(94)00057-I
author: Gung-Wei Chirn
author: Jason T. L. Wang
author: Kaizhong Zhang
published in: Information Sciences
publication date: 1997-06-16T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1022302
zbMATH Keywords: labeled graphs
zbMATH Keywords: approximate graph matching problem
MaRDI profile type: Publication
cites work: Q4065051
cites work: Q3670607
cites work: An Improved Algorithm For Approximate String Matching
cites work: Q4198056
cites work: The Noisy Substring Matching Problem
cites work: Optimization by Simulated Annealing
cites work: Fast parallel and serial approximate string matching
cites work: Pattern matching in a digitized image
cites work: A Tree-Matching Algorithm Based on Node Splitting and Merging
cites work: Q4003439
cites work: Approximate matching of regular expressions
cites work: Q4509227
cites work: The theory and computation of evolutionary distances: Pattern recognition
cites work: Exact and approximate algorithms for unordered tree matching
cites work: Fast algorithms for the unit cost editing distance between trees
cites work: The Tree-to-Tree Correction Problem
cites work: Q4010349
cites work: Q4001837
cites work: Finding approximate patterns in strings
cites work: An Algorithm for Subgraph Isomorphism
cites work: The String-to-String Correction Problem
cites work: Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
cites work: Approximate Tree Matching in the Presence of Variable Length Don′t Cares
cites work: On the editing distance between unordered labeled trees
full work available at URL: 0020-0255(94)00057-i
OpenAlex ID: W1983377546
description: scientific article; zbMATH DE number 1022302