Matching graphs with unique node labels

DOI10.1007/s10044-004-0222-5zbMath1422.68187OpenAlexW1967497571MaRDI QIDQ851709

Miro Kraetzl, Horst Bunke, Arek Dadej, Peter J. C. Dickinson

Publication date: 22 November 2006

Published in: PAA. Pattern Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10044-004-0222-5

zbMATH Keywords

graph matchinggraph edit distancegraph isomorphismmedian graphmaximum common subgraphunique node label

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Recovery of missing information in graph sequences by means of reference pattern matching and decision tree learning ⋮ Approximation of graph edit distance based on Hausdorff matching ⋮ Data Graph Formulation as the Minimum-Weight Maximum-Entropy Problem ⋮ Fifty years of graph matching, network alignment and network comparison ⋮ A comparative analysis of multidimensional features of objects resembling sets of graphs ⋮ A comparative analysis of new graph distance measures and graph edit distance ⋮ Efficient Suboptimal Graph Isomorphism

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Connected components in random graphs with given expected degree sequences
• A note on the derivation of maximal common subgraphs of two directed or undirected graphs
• Backtrack search algorithms and the maximal common subgraph problem
• An Algorithm for Subgraph Isomorphism
• A distance measure between attributed relational graphs for pattern recognition
• Constraint satisfaction algorithms for graph pattern matching

This page was built for publication: Matching graphs with unique node labels