Matching graphs with unique node labels
type: Item
instance of: scholarly article
title: Matching graphs with unique node labels
zbMATH Open document ID: 1422.68187
author: Horst Bunke
author: Arek Dadej
author: Miro Kraetzl
author: Peter J. C. Dickinson
published in: PAA. Pattern Analysis and Applications
publication date: 2006-11-22T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5075171
zbMATH Keywords: graph matching
zbMATH Keywords: graph isomorphism
zbMATH Keywords: maximum common subgraph
zbMATH Keywords: graph edit distance
zbMATH Keywords: median graph
zbMATH Keywords: unique node label
MaRDI profile type: Publication
full work available at URL: s10044-004-0222-5
OpenAlex ID: W1967497571
cites work: Q4418958
cites work: Q3671211
cites work: An Algorithm for Subgraph Isomorphism
cites work: A note on the derivation of maximal common subgraphs of two directed or undirected graphs
cites work: Backtrack search algorithms and the maximal common subgraph problem
cites work: A distance measure between attributed relational graphs for pattern recognition
cites work: Constraint satisfaction algorithms for graph pattern matching
cites work: Q4808936
cites work: Q4808930
cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time
cites work: Q4531774
cites work: Q4450805
cites work: Q4450785
cites work: Connected components in random graphs with given expected degree sequences
DOI: 10.1007/S10044-004-0222-5
description: scientific article; zbMATH DE number 5075171