This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Tree-Matching Algorithm Based on Node Splitting and Merging
February 1984 (vol. 6 no. 2)
pp. 249-256
S. Y. Lu, Exxon Production Research Company, P.O.Box 2189, Houston, TX 77025.
An algorithm that computes the best matching of two trees is described. The degree of mismatch, i.e., the distance, is measured in terms of the number of node splitting and merging operations required. The proposed tree distance is a more appropriate measurement of structural defonnation than the tree distance measure in terms of the number of insertions, deletions, and substitutions of tree nodes, as defined in previous studies. An algorithm that uses a divide-and-conquer strategy is presented. The analysis shows that the time complexity is O(NM2) where N and Al are the number of nodes of the two trees, respectively. The algorithm has been implemented on a VAX 11/780.
Citation:
S. Y. Lu, "A Tree-Matching Algorithm Based on Node Splitting and Merging," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 6, no. 2, pp. 249-256, Feb. 1984, doi:10.1109/TPAMI.1984.4767511
Usage of this product signifies your acceptance of the Terms of Use.