Graph Analysis and Visualization Algorithms. Visualization and Navigation Tools, Auto-placement Algorithms

The graphical representation of interacting objects is not only of theoretical interest, but also of serious practical application. The need to use graphs arises in the tasks of analyzing social and telecommunication networks, biological and epidemiological data, in marketing and banking. Despite the large number of frameworks and software products for visualizing networks, there are a number of drawbacks in existing applications: the lack of solutions that work immediately on all popular platforms, the non-optimal storage of internal data about vertices and edges, and the program interfaces are not oriented to analytical work with small graphs by due to the fact that in applications sharpened for large graphs of social networks, functions are mainly present only for the general topological analysis of the graph. Whereas on small graphs this information is not of particular value and of greater interest are: the functions of identifying implicit communities, including the possibility of iterative identification of communities for the possibility of a complete analysis of the graph structure [1]; the possibility of simple interaction with the image of the graph (zooming, moving the graph and the ability to manually arrange the vertices). The scientific and practical task to be solved is the development and implementation of algorithms and architectural solutions of software that are effective in terms of runtime and process volumes, allowing for analytical and visual analysis of networks of interacting objects. This work contains 56 pages, 30 illustrations. 8 sources were used during writing the work.