On an algorithm of zemlyachenko for subtree isomorphism (1999) [1 citations — 0 self]
Download:
|
|
by Yefim Dinitz, Alon Itai, Michael Rodeh
Inform. Process. Lett
http://www.cs.technion.ac.il/~itai/publications/zemlyachenko.ps
Add To MetaCart
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 data structures are new.
Citations
| 8 | Tarjan. Isomorphism of planar graphs – Hopcroft, E - 1972 |
| 6 | Finite graphs and networks – Busacker, Saaty - 1965 |
| 5 | Dendral-64: A system for computer construction, enumeration and notation of organic molecules as tree structures and cyclic graphs, Part I: Notation algorithm for tree structures – Lederberg - 1964 |
| 5 | Placing trees in lexicographic order – Scions - 1968 |
| 1 | Determining tree isomorphism – Zemlyachenko - 1971 |
