Subgraph error-correcting isomorphisms for syntactic pattern recognition

DOI10.1109/TSMC.1983.6313029MaRDI QIDQ3964034zbMATH OpenFDO

Authors Wen-Hsiang Tsai, King-Sun Fu

Publication date 1983

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

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

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Cited in

(8)

• A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile
• Kronecker product graph matching.
• A long trip in the charming world of graphs for pattern recognition
• Inexact graph matching using a hierarchy of matching processes
• Attributed relational graph matching based on the nested assignment structure
• Model-based stroke extraction and matching for handwritten Chinese character recognition
• A spectral-multiplicity-tolerant approach to robust graph matching
• Optimal assignment of task modules with precedence for distributed processing by graph matching and state-space search

This page was built for publication: Subgraph error-correcting isomorphisms for syntactic pattern recognition

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