Subgraph error-correcting isomorphisms for syntactic pattern recognition
From MaRDI portal
Publication:3964034
DOI10.1109/TSMC.1983.6313029zbMath0498.68055MaRDI QIDQ3964034
Publication date: 1983
Published in: IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)
Related Items (8)
Attributed relational graph matching based on the nested assignment structure ⋮ A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile ⋮ A long trip in the charming world of graphs for pattern recognition ⋮ A spectral-multiplicity-tolerant approach to robust graph matching ⋮ Kronecker product graph matching. ⋮ Optimal assignment of task modules with precedence for distributed processing by graph matching and state-space search ⋮ Model-based stroke extraction and matching for handwritten Chinese character recognition ⋮ Inexact graph matching using a hierarchy of matching processes
This page was built for publication: Subgraph error-correcting isomorphisms for syntactic pattern recognition