Matching graphs with unique node labels

DOI10.1007/S10044-004-0222-5zbMATH Open1422.68187OpenAlexW1967497571MaRDI QIDQ851709FDOQ851709

Authors: Horst Bunke, Arek Dadej, Miro Kraetzl, 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

Recommendations

• scientific article; zbMATH DE number 2043351
• Algorithms for approximate graph matching
• The graph matching problem
• scientific article; zbMATH DE number 2222791
• scientific article; zbMATH DE number 2043361

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)

Cites Work

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

Cited In (9)

• Title not available (Why is that?)
• Fifty years of graph matching, network alignment and network comparison
• Data Graph Formulation as the Minimum-Weight Maximum-Entropy Problem
• Graph unification and matching
• Efficient Suboptimal Graph Isomorphism
• 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
• A comparative analysis of new graph distance measures and graph edit distance
• A comparative analysis of multidimensional features of objects resembling sets of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q851709)