Voir la notice de l'article provenant de la source Math-Net.Ru
@article{IVM_2004_9_a6, author = {O. V. Rasin}, title = {A polynomial algorithm for the recognition of the isomorphism of almost trees}, journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika}, pages = {53--60}, publisher = {mathdoc}, number = {9}, year = {2004}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/IVM_2004_9_a6/} }
O. V. Rasin. A polynomial algorithm for the recognition of the isomorphism of almost trees. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 9 (2004), pp. 53-60. http://geodesic.mathdoc.fr/item/IVM_2004_9_a6/
[1] Akho Kh., Khopkroft Dzh., Ulman Dzh., Postroenie i analiz vychislitelnykh algoritmov, Mir, M., 1979, 536 pp. | MR | Zbl
[2] Hoffmann C. M., Group-theoretics algorithms and graph isomorphism, Lect. Notes Comput. Science, 136, 1982, viii+311 pp. | MR | Zbl
[3] Kargapolov M. I., Merzlyakov Yu. I., Osnovy teorii grupp, Nauka, M., 1972, 240 pp. | MR | Zbl
[4] Emelichev V. A., Melnikov O. I., Sarvanov V. I., Tyshkevich R. I., Lektsii po teorii grafov, Nauka, M., 1990, 384 pp. | MR | Zbl
[5] Evstigneev V. A., Kasyanov V. N., Teoriya grafov: algoritmy obrabotki derevev, VO Nauka. Sibirskaya izdatelskaya firma, Novosibirsk, 1994, 360 pp. | MR | Zbl
[6] Asanov M. O., Baranskii V. A., Rasin V. V., Diskretnaya matematika: grafy, matroidy, algoritmy, NITs “Regulyarnaya i khaoticheskaya dinamika”, Izhevsk, 2001, 288 pp.