Combinatorial search versus genetic algorithms: A case study based on the generalized median graph problem
- 30 November 1999
- journal article
- research article
- Published by Elsevier in Pattern Recognition Letters
- Vol. 20 (11-13) , 1271-1277
- https://doi.org/10.1016/s0167-8655(99)00094-x
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Error-tolerant graph matching: A formal framework and algorithmsPublished by Springer Nature ,1998
- Backtrack search algorithms and the maximal common subgraph problemSoftware: Practice and Experience, 1982
- An Algorithm for Subgraph IsomorphismJournal of the ACM, 1976