Алгоритм построения множества минимальных графов смежности при помощи самоуправляемых клик-собственников

The effective minimal join graph set synthesis algorithm (of self-managing cliques) from a given maximal knowledge pattern set exists, however it can be improved by engaging results of theory of algebraic Bayesian network global structure that is under development. The goal of the work is to improve the known minimal join graph set algorithm by perfecting designing set of vertices that cliques include: instead of full search of all the pairs of a vertex and a clique weight, particular search for each clique its descendants is suggested. A new algorithm of self-managed possessions cliques implementing suggested improvement is designed.