All Questions
1 question
2
votes
1
answer
1k
views
Algorithms for rooted directed acyclic graph isomorphism
Given two directed acyclic graphs $G_1$ and $G_2$, and their roots $r_1$ and $r_2$, is there a polynomial algorithm to determine if $G_1$ and $G_2$ are isomorphic?
- 21