Visual Analysis of Actions Performed with Big Graphs

Abstract

The basic concepts of using application development environments are presented in this paper. The way of using the GraphAnalyser application and its basic functions is also presented. All results of the experiments conducted are generated with this application. According to the experimental methodology, they fall into two groups: the first one includes actions related to the vertices of a graph, and the second one includes actions related to the edges and the dynamic allocation of memory to store the structure of a graph. The results show that when the number of vertices in a graph increases linearly, the time to add and remove these vertices also increases linearly. When the number of graph vertices increases linearly, the number of added vertices per millisecond remains relatively constant. However, the number of vertices removed for one millisecond for graphs containing between 10 and 70 million vertices varies. Similarly, when the number of graph edges increases linearly, the number of added edges per millisecond remains relatively constant. The summarized results of the two experiments show that the actions associated with adding, removing, and calculating the edge lengths are performed much more slowly than adding and removing the vertices.

An analysis between different algorithms for the graph vertex coloring problem

“…Many complex, significant and important problems can be presented and studied with graphs. Most often, these types of problems are analyzed and solved by software that executes specific algorithms [5]. This is one of the reasons why many researchers are researching and improving different algorithms for solving certain classes of problems, related and presented directly and indirectly through graph structures [6]- [8].…”

An analysis between exact and approximate algorithms for the k-center problem in graphs

“…In this case, the vertex v is the beginning of the arc, and the vertex u is the end of the arc. If a value is mapped to each edge, then the graph is called weighted [27], [28].…”