Median graphs: A genetic approach based on new theoretical properties
- 1 September 2009
- journal article
- research article
- Published by Elsevier in Pattern Recognition
- Vol. 42 (9) , 2003-2012
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Inexact graph matching using a genetic algorithm for image recognitionPattern Recognition Letters, 2007
- Median graph computation for graph clusteringSoft Computing, 2005
- An median graphs: properties, algorithms, and applicationsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2001
- A graph distance metric combining maximum common subgraph and minimum common supergraphPattern Recognition Letters, 2001
- Combinatorial search versus genetic algorithms: A case study based on the generalized median graph problemPattern Recognition Letters, 1999
- A graph distance metric based on the maximal common subgraphPattern Recognition Letters, 1998
- On a relation between graph edit distance and maximum common subgraphPattern Recognition Letters, 1997
- Genetic-based search for error-correcting graph isomorphismIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 1997
- Inexact graph matching for structural pattern recognitionPattern Recognition Letters, 1983
- Backtrack search algorithms and the maximal common subgraph problemSoftware: Practice and Experience, 1982