Author:
Nagoya Takayuki,Toda Seinosuke
Subject
General Computer Science,Theoretical Computer Science
Reference11 articles.
1. A note on decision versus search for graph automorphism;Agrawal;Information and Computation,1996
2. Graph isomorphism is in SPP;Arvind;Information and Computation,2006
3. A. Gál, S. Halevi, R. Lipton, E. Petrank, Computing from partial solutions, in: Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999, pp. 34–45
4. A. Lozano, J. Torán, On the nonuniform complexity of the graph isomorphism problem, in: Proceedings of the 7th Structure in Complexity Theory Conference, 1992, pp. 118–129
5. Computing complete graph isomorphisms and hamiltonian cycles from partial ones;Große;Theory of Computing Systems,2002
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Polynomial Time Algorithms for Variants of Graph Matching on Partial k-Trees;Foundations of Computing and Decision Sciences;2016-09-01
2. Variants of Graph Matching for Tree-like Graphs;2015 IEEE International Conference on Smart City/SocialCom/SustainCom (SmartCity);2015-12