Revisiting Tree Canonization using polynomials

V. Arvind, Samir Datta, Salman Faris +1

Graph Isomorphism (GI) is a fundamental algorithmic problem. Amongst graph classes for which the computational complexity of GI has been resolved, trees are arguably the most funda…