Median graphs: A genetic approach based on new theoretical properties

DOI10.1016/j.patcog.2009.01.034zbMath1192.68571MaRDI QIDQ2270833

M. Ferrer, E. Valveny, Francesc Serratosa

Publication date: 29 July 2009

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2009.01.034

zbMATH Keywords

graph matching; genetic search; median graph; maximum common subgraph; structural pattern recognition

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68T10: Pattern recognition, speech recognition

Related Items

Heuristics for the generalized median graph problem, On the Influence of Node Centralities on Graph Edit Distance for Graph Classification

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Applied graph theory in computer vision and pattern recognition
• On the minimum common supergraph of two graphs
• Finding a Maximum Clique in an Arbitrary Graph
• Backtrack search algorithms and the maximal common subgraph problem
• A graph distance metric based on the maximal common subgraph
• Inexact graph matching for structural pattern recognition
• A distance measure between attributed relational graphs for pattern recognition
• A graph distance metric combining maximum common subgraph and minimum common supergraph
• Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs
• Bipartite Graph Matching for Computing the Edit Distance of Graphs
• A Quadratic Programming Approach to the Graph Edit Distance Problem
• On the Relation Between the Median and the Maximum Common Subgraph of a Set of Graphs
• Graph-Theoretic Techniques for Web Content Mining