This article is cited in 1 paper

Information Technology Applications in Control

Fast search algorithms for two metric characteristics problems on weighted graphs

A. R. Urakov, T. V. Timeryaev

Ufa State Aviation Technical UniversityNPO Saturn

Abstract: Two problems are considered of metric characteristics search on weighted undirected graphs with non-negative edge weights. The first problem is to find the radius, diameter, at least one center, and one pair of peripheral vertices of an undirected graph with non-negative edge weights. In the second problem one also has the pre-calculated distances matrix. For these problems we propose fast search algorithms, which use only small fraction of graph vertices for metric characteristics search. The proposed algorithms are tested on various inputs against the other popular methods.

Keywords: metric characteristics of a graph, graph radius, graph diameter, graph center, graph peripheral vertices.

UDC: 519.173.5
BBK: 22.176