Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DA_2004_11_3_a5, author = {O. V. Rasin}, title = {Chain decompositions by distances, and graph isomorphisms}, journal = {Diskretnyj analiz i issledovanie operacij}, pages = {63--79}, publisher = {mathdoc}, volume = {11}, number = {3}, year = {2004}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/DA_2004_11_3_a5/} }
O. V. Rasin. Chain decompositions by distances, and graph isomorphisms. Diskretnyj analiz i issledovanie operacij, Tome 11 (2004) no. 3, pp. 63-79. http://geodesic.mathdoc.fr/item/DA_2004_11_3_a5/
[1] Asanov M. O., Baranskii V. A., Rasin V. V., Diskretnaya matematika: grafy, matroidy, algoritmy, NITs “Regulyarnaya i khaoticheskaya dinamika”, Izhevsk, 2001
[2] Akho Kh., Khopkroft Dzh., Ulman Dzh., Postroenie i analiz vychislitelnykh algoritmov, Mir, M., 1979 | MR | Zbl
[3] Kargapolov M. I., Merzlyakov Yu. I., Osnovy teorii grupp, Nauka, M., 1972 | MR | Zbl
[4] Ponomarenko I. N., “Problema izomorfizma dlya klassov grafov”, Dokl. AN SSSR, 304:3 (1989), 552–556 | MR | Zbl
[5] Bodlaender H. L., de Fluiter B., Thilikos D. M., Yamazaki K., “Isomorphism for graphs of bounded distance width”, Algorithmica, 24:2 (1999), 105–127 | DOI | MR | Zbl
[6] Hoffmann C. M., Group-theoretics algorithms and graph isomorphism, Lecture Notes in Comput. Sci., 136, Springer-Verlag, Berlin, 1982 | MR | Zbl