Changes in properties of the transport network graph when using simplification algorithms

Abstract

In the course of solving problems of managing and planning the development of large transport networks, a big amount of heterogeneous data from various sources is accumulated. The methods of graph theory are used to systematize information, process it, and calculate network characteristics. However, the problem arises of the enormous complexity and duration of computations over graphs of large networks. One of the approaches to solve this problem is the simplification of the original graph. In our report we study the influence of processing and basic graph simplification on the initial properties of the network. © 2019 Author(s).