Author:
Nagoya Takayuki,Toda Seinosuke
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Agrawal, M., Arvind, V.: A note on decision versus search for graph automorphism. Information and computation 131, 179–189 (1996)
2. Große, A., Rothe, J., Wechung, G.: Computing complete graph isomorphisms and hamiltonian cycles from partial ones. Theory of Computing Systems 35, 81–93 (2002)
3. Gál, A., Halevi, S., Lipton, R., Petrank, E.: Computing from partial solutions. In: Proceedings of the 14th Annual IEEE Conference on Computational Complexity, May 1999, pp. 34–45. IEEE Computer Society Press, Los Alamitos (1999)
4. Köbler, J., Schöning, U., Torán, J.: The Graph Isomorphism Problem: Its Structural Complexity. Birkhauser (1993)
5. Lozano, A., Torán, J.: On the nonuniform complexity of the graph isomorphism problem. In: Proceedings of the 7th Structure in Complexity Theory Conference, 1992, pp. 118–129 (1992)