Author:
Belmonte Rémy,Otachi Yota,Schweitzer Pascal
Funder
Japan Society for the Promotion of Science
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference34 articles.
1. Babai, L.: Graph isomorphism in quasipolynomial time. CoRR, abs/1512.03547 (To appear in STOC 2016) (2015)
2. Błasiok, J., Kamiński, M., Raymond, J.-F., Trunck, T.: Induced minors and well-quasi-ordering. Electr. Notes Discrete Math. 49, 197–201 (2015)
3. Boliac, R., Lozin, V.V.: On the clique-width of graphs in hereditary classes. In: ISAAC 2002, vol. 2518 of Lecture Notes in Computer Science, pp. 44–54 (2002)
4. Booth, K.S., Colbourn, C.J.: Problems polynomially equivalent to graph isomorphism. Technical Report CS-77-04, Computer Science Department, University of Waterloo (1979)
5. Colbourn, C.J.: On testing isomorphism of permutation graphs. Networks 11(1), 13–21 (1981)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献