|
Fundamentalnaya i Prikladnaya Matematika, 2014, Volume 19, Issue 1, Pages 165–172
(Mi fpm1571)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Algorithms for searching paths in huge graphs
I. V. Polyakov, A. A. Chepovskiy, A. M. Chepovskiy National Research University "Higher School of Economics", Moscow, Russia
Abstract:
Various approaches for data storing and processing are investigated in this paper. A new algorithm for finding paths in a huge graph is introduced.
Citation:
I. V. Polyakov, A. A. Chepovskiy, A. M. Chepovskiy, “Algorithms for searching paths in huge graphs”, Fundam. Prikl. Mat., 19:1 (2014), 165–172; J. Math. Sci., 211:3 (2015), 413–417
Linking options:
https://www.mathnet.ru/eng/fpm1571 https://www.mathnet.ru/eng/fpm/v19/i1/p165
|
Statistics & downloads: |
Abstract page: | 580 | Full-text PDF : | 550 | References: | 62 |
|