05.13.18 (Mathematical modelling, calculating methods, and the program systems)
E-mail:
,
Biography
Main publications:
Kochkarov A. A., Malinetskii G. G. Modelirovanie rasprostraneniya vnesh-nikh vozdeistvii po strukture slozhnoi sistemy // Matematicheskoe modelirovanie, 2006. T. 18, # 2. S. 51–60.
Kochkarov A. A., Kochkarov R. A. Parallelnyi algoritm poiska kratchaishego puti na predfraktalnom grafe // Zhurnal vychil. matem. i matem. fiz. 2004. T. 44, # 6. S. 1157–1162.
Kochkarov A. A., Kochkarov R. A. Parallelnye algoritmy na predfraktalnykh grafakh. Preprint # 84. M.: IPMatem. im. M. V. Keldysha RAN, 2003. 20 s.
A. V. Tymoshenko, R. A. Kochkarov, A. A. Kochkarov, “Identification conditions for the solvability of NP-complete problems for the class of pre-fractal graphs”, Model. Anal. Inform. Sist., 28:2 (2021), 126–135
2015
2.
A. A. Kochkarov, R. A. Kochkarov, G. G. Malinetskii, “Issues of dynamic graph theory”, Zh. Vychisl. Mat. Mat. Fiz., 55:9 (2015), 1623–1629; Comput. Math. Math. Phys., 55:9 (2015), 1590–1596
L. I. Sennikova, A. A. Kochkarov, “A parallel algorithm for searching the minimum weight spanning tree on prefractal graph”, Prikl. Diskr. Mat. Suppl., 2012, no. 5, 95–97
2011
4.
A. A. Kochkarov, L. I. Sennikova, N. N. Bolurov, “On some prefractal graphs properties”, Prikl. Diskr. Mat., 2011, no. supplement № 4, 93–94
5.
A. A. Kochkarov, L. I. Sennikova, “Some prefractal graph's connectivity characteristics estimations”, Prikl. Diskr. Mat., 2011, no. 4(14), 56–61
A. A. Kochkarov, R. A. Kochkarov, “A parallel algorithm for searching for the shortest path on a prefractal graph”, Zh. Vychisl. Mat. Mat. Fiz., 44:6 (2004), 1147–1152; Comput. Math. Math. Phys., 44:6 (2004), 1088–1092