By Topic

A metric between unrooted and unordered trees and its bottom-up computing method

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
E. Tanaka ; Dept. of Electr. & Electron. Eng., Kobe Univ., Japan

Proposes a distance measure between unrooted and unordered trees based on the strongly structure-preserving mapping (SSPM). SSPM can make correspondences between the vertices of similar substructures of given structures more strictly than previously proposed mappings. The time complexity of computing the distance between trees Ta and T b is O(mb3NaNb), where Na and Nb are the number of vertices in trees Ta and Tb, respectively; ma and m b are the maximum degrees of a vertex in Ta and T b, respectively; and ma⩽mb is assumed. The space complexity of the method is O(NaNb )

Published in:

IEEE Transactions on Pattern Analysis and Machine Intelligence  (Volume:16 ,  Issue: 12 )