eidan's blog

By eidan, history, 3 years ago, In English

I was reading about tree isomorphism and came across this paper. It explains an amazing algorithm developed by Aho, Hopcroft and Ullman which finds out if two rooted trees are isomorphic in linear time. I have searched for this problem on several online judges in order to test my implementation, but have had no success. If anyone has seen a problem that requires this algorithm could he/she be so kind to share the link?

Any help is appreciated :)

 
 
 
 
  • Vote: I like it
  • -3
  • Vote: I do not like it

»
3 years ago, # |
  Vote: I like it +3 Vote: I do not like it

Something like that? Problem

  • »
    »
    3 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Thank you for sharing. However, that is not exactly what I am looking for. That problem requires checking if two binary trees are isomorphic. I have actually already tested this algorithm on that problem XD. But now I want to test if my implementation works on any type of rooted tree, not only binary.

    • »
      »
      »
      3 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      I think it could help so Any type tree Problem

      • »
        »
        »
        »
        3 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        That is a great example too. However, in that problem, the tree is not rooted.

        • »
          »
          »
          »
          »
          3 years ago, # ^ |
            Vote: I like it +6 Vote: I do not like it

          No, it doesn’t really matter. Can you see why?

          Spoiler
          • »
            »
            »
            »
            »
            »
            6 weeks ago, # ^ |
              Vote: I like it 0 Vote: I do not like it

            Sorry for the possible necroposting, but there is a possible (but somewhat trivial) constant-optimization that can be done.

            If the numbers of centroids do not match, the trees are not isomorphic.

            If both have one centroid, it suffices to check after rooting by that centroid.

            If both have two centroids, then fix one centroid in one tree and check both centroids in the other tree.

            This gives a speed-up of about 2x in the worst-case :)

»
3 years ago, # |
  Vote: I like it +10 Vote: I do not like it

This appeared in the Indian online regional — https://www.codechef.com/problems/TWOTREES

»
3 years ago, # |
  Vote: I like it 0 Vote: I do not like it
»
7 weeks ago, # |
  Vote: I like it +8 Vote: I do not like it

Hey,

This one isn't rooted, but by using the technique ko_osaga mentioned above, it should be reducible into it anyway. It's from a recent ICPC Regional.

Hope it helps!