In recent results the complexity of isomorphism testing on
graphs of bounded treewidth is improved to TC^1 [GV06] and further to LogCFL [DTW10].
The computation of canonical forms or a canonical labeling provides more information than
isomorphism testing.
Whether canonization is in NC or even TC^1 was stated ... more >>>