English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

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 presented values of indices of reachability and faulttolerance is described and illustrated by the examples.

USE OF MELENTIEV’S GRAPH REPRESENTATION METHOD FOR DETECTION OF CLIQUES AND THE ANALYSIS OF TOPOLOGIES OF COMPUTING SYSTEMS