Voir la notice de l'article provenant de la source Math-Net.Ru
@article{MP_1999_a16, author = {H. Reiter and I. M. Sonin}, title = {{\CYRN}{\cyra}{\cyrg}{\cyrl}{\cyrya}{\cyrd}{\cyrn}{\cyra}{\cyrya} {\cyri}{\cyrn}{\cyrt}{\cyre}{\cyrr}{\cyrp}{\cyrr}{\cyre}{\cyrt}{\cyra}{\cyrc}{\cyri}{\cyrya} {\cyrn}{\cyre}{\cyrk}{\cyro}{\cyrt}{\cyro}{\cyrr}{\cyrery}{\cyrh} {\cyra}{\cyrl}{\cyrg}{\cyro}{\cyrr}{\cyri}{\cyrt}{\cyrm}{\cyro}{\cyrv} {\cyrn}{\cyra} {\cyrg}{\cyrr}{\cyra}{\cyrf}{\cyra}{\cyrh}}, journal = {Matematicheskoe Prosveshchenie}, pages = {208--212}, publisher = {mathdoc}, year = {1999}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/MP_1999_a16/} }
H. Reiter; I. M. Sonin. Наглядная интерпретация некоторых алгоритмов на графах. Matematicheskoe Prosveshchenie, Matematicheskoe Prosveshchenie (1999), pp. 208-212. http://geodesic.mathdoc.fr/item/MP_1999_a16/
[1] K. P. Bogart, Introductory Combinatorics, 2nd ed., Harcourt Brace Jovanovich, New York, 1990 | MR
[2] G. Chartand, L. Lesniak, Graphs and Digraphs, 2nd ed., Wadsworth Brooks/Cole, Monterey, CA, 1986
[3] A. Gibbons, Algorithmic graph theory, Cambridge University Press, Cambridge, 1985 | MR | Zbl
[4] F. Harary, Graph theory, Addison-Wesley, Reading, MA, 1969 | MR | Zbl
[5] J. A. McHugh, Algorithmic graph theory, Prentice Hall, Englewood Cliffs, NJ, 1990 | Zbl
[6] F. S. Roberts, Applied Combinatorics, Prentice Hall, Englewood Cliffs, NJ, 1984 | MR
[7] A. A. Zykov, Osnovy teorii grafov, Nauka, M., 1987
[8] F. Kharari, Teoriya grafov, M., Mir
[9] N. Kristofides, Teoriya grafov. Algoritmicheskii podkhod, Mir, M., 1978
[10] A. Akho, Dzh. Khopkroft, Dzh. Ulman, Postroenie i analiz vychislitelnykh algoritmov, Mir, M., 1979