Referenced Items are not available for this document.
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:
Pattern Analysis and Machine Intelligence, IEEE Transactions on
(Volume:16
,
Issue:
12
)
Date of Publication: Dec 1994
- Page(s):
- 1233 - 1238
- ISSN :
- 0162-8828
- INSPEC Accession Number:
- 4871848
- Digital Object Identifier :
- 10.1109/34.387483
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Dec 1994
- Sponsored by :
- IEEE Computer Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
