RUS  ENG
Full version
JOURNALS // Fundamentalnaya i Prikladnaya Matematika // Archive
Fundam. Prikl. Mat., 2014 Volume 19, Issue 1, Pages 165–172 (Mi fpm1571)
This article is cited 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.

UDC: 004.421.2+519.178


 English version: Journal of Mathematical Sciences (New York), 2015, 211:3, 413–417

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024