An algorithm for graph optimal monomorphism

DOI10.1109/21.57275zbMath0709.68041OpenAlexW2163517496MaRDI QIDQ3493248

No author found.

Publication date: 1990

Published in: IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/21.57275

zbMATH Keywords

algorithmpattern recognitionbranch-and-boundtree search problemgraph optimal isomorphism

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

A long trip in the charming world of graphs for pattern recognition ⋮ Model-based stroke extraction and matching for handwritten Chinese character recognition

This page was built for publication: An algorithm for graph optimal monomorphism