A Tree-Matching Algorithm Based on Node Splitting and Merging

DOI10.1109/TPAMI.1984.4767511MaRDI QIDQ3309098zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 1984

Published in IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)

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

zbMATH Keywords

distancedivide-and-conquernode mergingnode splittingpattern correlationpattern matchingpattern recognitiontree matching

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10)

Cited in

(5)

• Constrained tree editing
• Algorithms for approximate graph matching
• Using position extrema points to capture shape in on-line handwritten signature verification
• Modeling synergies in multi-criteria supplier selection and order allocation: an application to commodity trading
• A survey on tree edit distance and related problems

This page was built for publication: A Tree-Matching Algorithm Based on Node Splitting and Merging

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