Tree Isomorphism

Sort by

recency

|

4 Discussions

|

  • + 0 comments

    When will this problem be posted on the open challenges on the main part of the website?

  • + 0 comments

    I'm looking for a solution written in C++, couldn't find one so far. If you have one, could you please share it with me?

  • + 0 comments

    How is the hash in the editorial calculated?

  • + 1 comment

    What do you mean by non-isomorphic trees? Isomorphism is defined on two trees. Do you want the size of the set of trees for which no pair of trees are isomorphic?

    • + 1 comment

      Yes. You need to find the size of the largest set of subtrees of the given tree, for which no two trees are isomorphic.

      • + 1 comment

        Quite a problem you have here, the graph isomorphism problem is NP-hard. I'm looking forward to see the editorial on this one

        • + 0 comments

          Look at the constraints.

No more comments