Yefim Dinitz, Alon Itai, Michael Rodeh  Home/Search
Context Related
| cs.bgu.ac.il/~dinitz/Papers/Zeml.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.bgu.ac.il/~dinitz/pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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. (Update)
Cited by: More
New Strahler numbers for rooted plane trees - Auber Delest Domenger (Correct)
Active bibliography (related documents): More All
0.9: On an Algorithm of Zemlyachenko for Subtree Isomorphism - Dinitz, Itai, Rodeh (1998) (Correct)
0.5: Bottom-up Subtree Isomorphism for Unordered Labeled Trees - Luccio, Enriquez.. (2004) (Correct)
0.3: The Advantages of Forward Thinking in Generating Rooted and Free .. - Extend Ed (Correct)
Similar documents based on text: More All
0.3: On the Single-Source Unsplittable Flow Problem - Dinitz, Garg, Goemans (1999) (Correct)
0.3: Symmetry Breaking In Distributed Networks - Itai, Rodeh (1981) (Correct)
0.3: The Multi-Tree Approach to Reliability in Distributed Networks - Itai, Rodeh (1984) (Correct)
Related documents from co-citation: More All
2: an asymptotic method in enumeration (context) - Meir, Moon - 1989
BibTeX entry: (Update)
M. Rodeh Y. Dinitz, A. Itai. On an algorithm of Zemlyachenko for subtree isomorphism. Information Processing Letters, 703:141146, 1999. http://citeseer.ist.psu.edu/dinitz98algorithm.html More
@article{ dinitz99algorithm,
author = "Yefim Dinitz and Alon Itai and Michael Rodeh",
title = "On an algorithm of {Zemlyachenko} for subtree isomorphism",
journal = "Information Processing Letters",
volume = "70",
number = "3",
pages = "141--146",
year = "1999",
url = "citeseer.ist.psu.edu/dinitz98algorithm.html" }
Citations (may not include all citations):10 Isomorphism of planar graphs (context) - Hopcroft, Tarjan - 1972
5 Finite graphs and networks (context) - Busacker, Saaty - 1965
3 enumeration and notation of organic molecules as tree struct.. (context) - Lederberg, for et al. - 1964
3 Placing trees in lexicographic order (context) - Scions - 1968
2 Determining tree isomorphism (context) - Zemlyachenko - 1971
Documents on the same site (http://www.cs.bgu.ac.il/~dinitz/pub.html): More
On the Single-Source Unsplittable Flow Problem - Dinitz, Garg (Correct)
Maintaining the Classes of 4-Edge-Connectivity in a Graph.. - Dinitz, Westbrook (1995) (Correct)
Bit Complexity of Breaking and Achieving Symmetry in.. - Dinitz, Moran, Rajsbaum (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC