On an algorithm of Zemlyachenko for subtree isomorphism

Yefim Dinitz; Alon Itai; Michael Rodeh

doi:10.1016/S0020-0190(99)00054-X

On an algorithm of Zemlyachenko for subtree isomorphism

Yefim Dinitz, Alon Itai, Michael Rodeh

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

23 Scopus citations

Abstract

Zemlyachenko's linear time algorithm for free tree isomorphism is unique in that it also partitions the set of rooted subtrees of a given rooted tree into isomorphism equivalence classes. Unfortunately, his algorithm is very hard to follow. In this note, we use modern data structures to explain and implement Zemlyachenko's scheme. We give a full description of a free rendition of his method using some of his ideas and adding some new ones; in particular, the usage of the data structures is new.

Original language	English
Pages (from-to)	141-146
Number of pages	6
Journal	Information Processing Letters
Volume	70
Issue number	3
DOIs	https://doi.org/10.1016/S0020-0190(99)00054-X
State	Published - 14 May 1999

ASJC Scopus subject areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/S0020-0190(99)00054-X

Cite this

@article{d7b5e8b1ad684e088f5f6b1989a57330,

title = "On an algorithm of Zemlyachenko for subtree isomorphism",

abstract = "Zemlyachenko's linear time algorithm for free tree isomorphism is unique in that it also partitions the set of rooted subtrees of a given rooted tree into isomorphism equivalence classes. Unfortunately, his algorithm is very hard to follow. In this note, we use modern data structures to explain and implement Zemlyachenko's scheme. We give a full description of a free rendition of his method using some of his ideas and adding some new ones; in particular, the usage of the data structures is new.",

author = "Yefim Dinitz and Alon Itai and Michael Rodeh",

year = "1999",

month = may,

day = "14",

doi = "10.1016/S0020-0190(99)00054-X",

language = "English",

volume = "70",

pages = "141--146",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - On an algorithm of Zemlyachenko for subtree isomorphism

AU - Dinitz, Yefim

AU - Itai, Alon

AU - Rodeh, Michael

PY - 1999/5/14

Y1 - 1999/5/14

N2 - Zemlyachenko's linear time algorithm for free tree isomorphism is unique in that it also partitions the set of rooted subtrees of a given rooted tree into isomorphism equivalence classes. Unfortunately, his algorithm is very hard to follow. In this note, we use modern data structures to explain and implement Zemlyachenko's scheme. We give a full description of a free rendition of his method using some of his ideas and adding some new ones; in particular, the usage of the data structures is new.

AB - Zemlyachenko's linear time algorithm for free tree isomorphism is unique in that it also partitions the set of rooted subtrees of a given rooted tree into isomorphism equivalence classes. Unfortunately, his algorithm is very hard to follow. In this note, we use modern data structures to explain and implement Zemlyachenko's scheme. We give a full description of a free rendition of his method using some of his ideas and adding some new ones; in particular, the usage of the data structures is new.

UR - http://www.scopus.com/inward/record.url?scp=0345580861&partnerID=8YFLogxK

U2 - 10.1016/S0020-0190(99)00054-X

DO - 10.1016/S0020-0190(99)00054-X

M3 - Article

AN - SCOPUS:0345580861

SN - 0020-0190

VL - 70

SP - 141

EP - 146

JO - Information Processing Letters

JF - Information Processing Letters

IS - 3

ER -

On an algorithm of Zemlyachenko for subtree isomorphism

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this