Fast search of weighted graph characteristics using distances matrix

Abstract

Algorithms for fast search of the center, the radius and the diameter of weighted graphs are being proposed. The proposed algorithms use the structuredness of road networks graphs for the search acceleration. The comparison of the proposed algorithms with the search of graph characteristics by a simple examination of all elements of distance matrix are being presented.