Author:
Klavík Pavel,Knop Dušan,Zeman Peter
Funder
Ministerstvo Školství, Mládeže a Tělovýchovy
Subject
General Computer Science,Theoretical Computer Science
Reference95 articles.
1. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebraic Discrete Methods,1987
2. Finding small weight isomorphisms with additional constraints is fixed-parameter tractable;Arvind,2017
3. A linear-time algorithm for testing the truth of certain quantified Boolean formulas;Aspvall;Inf. Process. Lett.,1979
4. On the Isomorphism Problem;Babai,1977
5. Graph isomorphism in quasipolynomial time;Babai,2016
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献