RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika // Archive

Prikl. Diskr. Mat., 2012 Number 2(16), Pages 95–99 (Mi pdm368)

This article is cited in 2 papers

Applied Graph Theory

Using weighted graphs features for fast searching their parameters

A. R. Urakov, T. V. Timeryaev

Ufa State Aviation Technical University, Ufa, Russia

Abstract: In this paper, some algorithms are presented for the fast search of center, radius and diameter of weighted graphs on all-pairs shortest path matrix, using features of real-world road networks graphs. They are compared with algorithms searching these parameters by simple pass through elements of matrix.

Keywords: graph center, graph radius, graph diameter, all-pairs shortest path matrix, graph features, weighted graph.

UDC: 519.173.5



© Steklov Math. Inst. of RAS, 2026