USE OF MELENTIEV'S GRAPH REPRESENTATION METHOD FOR DETECTION OF CLIQUES AND THE ANALYSIS OF TOPOLOGIES OF COMPUTING SYSTEMS
The problem of comparison of the computing systems (CS) topologies is related with finding of maximum cliques in the CS graph. The solution of this task based on using of the representation of the graph offered by the Author is provided in this paper. Properties of projections of the complete graph and projections of cliques of general graph are formulated. The algorithm to identify the maximum clique of the given graph of the computing system and of its modifications corresponding to presetted values of indices of reachability and fault-tolerance is described and illustrated by the examples.