Combinatorial search versus genetic algorithms: A case study based on the generalized median graph problem

Pattern Recognition Letters

Volumn 20, Issue 11-13, 1999, Pages 1271-1277

  Bunke, Horst ^a   Münger, Andreas ^a   Jiang, Xiaoyi ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; GRAPH THEORY;

COMBINATORIAL SEARCH; GENERALIZED MEDIAN GRAPH;

OBJECT RECOGNITION;

EID: 0342973213     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8655(99)00094-X     Document Type: Article

References (6)

1. Bunke, H., 1998. Error-tolerant graph matching: A formal framework and algorithms. In: Armin, A., et al. (Eds.), Advances in Pattern Recognition. Springer, Berlin, pp. 1-14.
2. Goldberg, D.E., 1989. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, MA.
3. Mc Gregor, J., 1982. Backtrack search algorithms and the maximal common subgraph problem. Software - Practice and Experience 12, 23-34.
4. Jiang, X., Münger, A., Bunke, H., 1999. Computing the generalized median of a set of graphs. In: Proc. IAPR Workshop on Graph-based Representations.
5. Messmer, B.T., Bunke, H., 1996. Clustering and error-correcting matching of graphs for learning and recognition of symbols in engineering drawings. In: Proc. Workshop on Document Analysis Systems, pp. 282-296.
6. Ullman, J.R., 1976. Algorithm for subgraph isomorphism. Journal of the Association for Computing Machinery 23 (1), 31-42.