# Algorithms for the isomorphism of the rooted acyclic graph

Given two acyclic charts directed. $$G_1$$ Y $$G_2$$, and its roots $$r_1$$ Y $$r_2$$, Is there a polynomial algorithm to determine if $$G_1$$ Y $$G_2$$ Are they isomorphic?