Funder
grantová agentura ceské republiky
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference30 articles.
1. Ağaoğlu Çağırıcı, D., Hliněný, P.: Isomorphism testing for t-graphs in FPT. In WALCOM, Volume 13174 of Lecture Notes in Computer Science, pp. 239–250. Springer (2022). arXiv:2111.10910, https://doi.org/10.1007/978-3-030-96731-4_20
2. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Boston (1974)
3. Arvind, V., Nedela, R., Ponomarenko, I., Zeman, P.: Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable. CoRR. Accepted to WG 2022. arXiv:2107.10689 (2021)
4. Babai, L.: Monte Carlo algorithms in graph isomorphism testing. Technical Report 79-10, Université de Montréal (1979)
5. Babai, L.: Graph isomorphism in quasipolynomial time [extended abstract]. In: Wichs, D., Mansour, Y. (eds.) Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18–21, 2016, pp. 684–697. ACM (2016). https://doi.org/10.1145/2897518.2897542
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献