Matching graphs with unique node labels

DOI10.1007/S10044-004-0222-5MaRDI QIDQ851709zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 3823850 (Why is no real title available?)
• scientific article; zbMATH DE number 1957457 (Why is no real title available?)
• scientific article; zbMATH DE number 2043351 (Why is no real title available?)
• scientific article; zbMATH DE number 2043368 (Why is no real title available?)
• scientific article; zbMATH DE number 1744977 (Why is no real title available?)
• scientific article; zbMATH DE number 2090201 (Why is no real title available?)
• scientific article; zbMATH DE number 2090206 (Why is no real title available?)
• A distance measure between attributed relational graphs for pattern recognition
• A note on the derivation of maximal common subgraphs of two directed or undirected graphs
• An Algorithm for Subgraph Isomorphism
• Backtrack search algorithms and the maximal common subgraph problem
• Connected components in random graphs with given expected degree sequences
• Constraint satisfaction algorithms for graph pattern matching
• Isomorphism of graphs of bounded valence can be tested in polynomial time

Cited in

(10)

• Efficient Suboptimal Graph Isomorphism
• Data graph formulation as the minimum-weight maximum-entropy problem
• Recovery of missing information in graph sequences by means of reference pattern matching and decision tree learning
• Node matching computation between two large graphs in linear computational cost
• Fifty years of graph matching, network alignment and network comparison
• A comparative analysis of multidimensional features of objects resembling sets of graphs
• Graph unification and matching
• Approximation of graph edit distance based on Hausdorff matching
• A comparative analysis of new graph distance measures and graph edit distance
• scientific article; zbMATH DE number 2043351 (Why is no real title available?)

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)