On an algorithm of Zemlyachenko for subtree isomorphism

Yefim Dinitz, Alon Itai, Michael Rodeh

Research output: Contribution to journalArticlepeer-review

23 Scopus citations


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 languageEnglish
Pages (from-to)141-146
Number of pages6
JournalInformation Processing Letters
Issue number3
StatePublished - 14 May 1999

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications


Dive into the research topics of 'On an algorithm of Zemlyachenko for subtree isomorphism'. Together they form a unique fingerprint.

Cite this