Author:
Arvind Vikraman,Köbler Johannes,Kuhnert Sebastian,Rattan Gaurav,Vasudev Yadu
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Arvind, V., Das, B., Köbler, J., Kuhnert, S.: The isomorphism problem for k-trees is complete for logspace. Inf. Comput. 217, 1–11 (2012)
2. Agrawal, M., Thierauf, T.: The Boolean Isomorphism Problem. In: FOCS, pp. 422–430 (1996)
3. Babai, L., Codenotti, P.: Isomorhism of hypergraphs of low rank in moderately exponential time. In: FOCS, pp. 667–676 (2008)
4. Lecture Notes in Computer Science;E. Böhler,2004
5. Babai, L., Luks, E.M.: Canonical labeling of graphs. In: STOC, pp. 171–183 (1983)