AN ALGORITHM TO COMPUTE THE LOGICAL ENTROPY OF A DIRECTED GRAPH

Guram Kashmadze
2016 GESJ: Computer Science and Telecommunications   unpublished
By the concept of logical entropy of a directed graph we mean the logical entropy of graph partition into strongly connected components. Algorithms for working with graphs are fundamental for computer science because many interesting computational problems are formulated in terms of graphs. Many algorithms that work with graphs begin with decomposition a graph into its strongly connected components. After decomposition such algorithms explore separately each one and then combine local solutions
more » ... into global solution according to the structure of a graph. Partition a directed graph into strongly connected components has many applications in different areas. The notion of logical entropy, that is based on a partition logic, gives us the ability to compare different partitions of a graph into components. In this article we suggest an algorithm to compute the logical entropy of partition of a directed graph into strongly connected components. This algorithm is based on well-known one, which finds strongly connected components by using the Depth-First-Search twice. The algorithm presented here can be regarded as a new application of DFS.
fatcat:3qkds2gxwrdb5oo75zpbtguznu