|
|
Publications in Math-Net.Ru
-
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
-
Issues of dynamic graph theory
Zh. Vychisl. Mat. Mat. Fiz., 55:9 (2015), 1623–1629
-
A parallel algorithm for searching the minimum weight spanning tree on prefractal graph
Prikl. Diskr. Mat. Suppl., 2012, no. 5, 95–97
-
On some prefractal graphs properties
Prikl. Diskr. Mat., 2011, no. supplement № 4, 93–94
-
Some prefractal graph's connectivity characteristics estimations
Prikl. Diskr. Mat., 2011, no. 4(14), 56–61
-
Simulation of Compound Systems Destruction. Structural Aspects
Keldysh Institute preprints, 2007, 033, 20 pp.
-
A discrete model of compound systems destruction
Probl. Upr., 2007, no. 5, 21–26
-
Utside influence extending over a compound system structure
Mat. Model., 18:2 (2006), 51–60
-
Providing of complex systems durability. Structural aspects
Keldysh Institute preprints, 2005, 053, 34 pp.
-
Complex system security and robustness management under external impacts
Probl. Upr., 2005, no. 5, 70–76
-
A parallel algorithm for searching for the shortest path on a prefractal graph
Zh. Vychisl. Mat. Mat. Fiz., 44:6 (2004), 1147–1152
-
Parallel algorithms for prefractal graphs
Keldysh Institute preprints, 2003, 084, 18 pp.
-
On planarity and other fractal graphs topological properties
Keldysh Institute preprints, 2003, 083, 18 pp.
-
Prefractal graphs in designing compound structures
Keldysh Institute preprints, 2003, 010, 21 pp.
© , 2026