An algorithm for graph optimal monomorphism

DOI10.1109/21.57275MaRDI QIDQ3493248zbMATH OpenOpenAlexFDO

Authors

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

algorithmbranch-and-boundgraph optimal isomorphismpattern recognitiontree search problem

Mathematics Subject Classification ID

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

Recommendations

• An algorithm for optimal isomorphism between two random graphs
• scientific article; zbMATH DE number 2097443
• An efficient A^* based algorithm for optimal graph matching applied to computer vision
• A heuristic algorithm of recognition of isomorphism of graphs
• Evolutionary Computation in Combinatorial Optimization

Cited in

(3)

• A long trip in the charming world of graphs for pattern recognition
• An efficient A^* based algorithm for optimal graph matching applied to computer vision
• Model-based stroke extraction and matching for handwritten Chinese character recognition

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3493248)