A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
AN ALGORITHM TO COMPUTE THE LOGICAL ENTROPY OF A DIRECTED GRAPH

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

fatcat:3qkds2gxwrdb5oo75zpbtguznu