|
|
|
Publications in Math-Net.Ru |
Citations |
|
2017 |
| 1. |
A. R. Urakov, T. V. Timeryaev, “Algorithm for dynamic all-pairs distances in graph”, UBS, 65 (2017), 60–86   |
1
|
|
2013 |
| 2. |
A. R. Urakov, T. V. Timeryaev, “Two problems of weighted graphs approximation and their solution algorithms”, Prikl. Diskr. Mat., 2013, no. 3(21), 86–92 |
| 3. |
A. R. Urakov, T. V. Timeryaev, “All-pairs shortest paths algorithm for high-dimensional sparse graphs”, Prikl. Diskr. Mat., 2013, no. 1(19), 84–92 |
1
|
| 4. |
A. R. Urakov, T. V. Timeryaev, “Fast search algorithms for two metric characteristics problems on weighted graphs”, UBS, 42 (2013), 153–172 |
1
|
|
2012 |
| 5. |
A. R. Urakov, T. V. Timeryaev, “Using weighted graphs features for fast searching their parameters”, Prikl. Diskr. Mat., 2012, no. 2(16), 95–99 |
2
|
|
| Organisations |
|
|
