Minimal join graphs' set synthesis: Performance statistical estimate of the decremental algorithm

The aim of the work is to develop the minimal join graphs' set synthesis decremental algorithm and to provide a comparative analysis of both direct and decremental algorithms. The algorithm was developed and implemented, and its consistency was confirmed with the mathematics proof. Comparative analysis was carried out as statistical tests which show temporal work ratios of the cited algorithms on primary structures of different capacities. Statistical experiments demonstrated that decremental algorithm is faster than the direct one in range of 4-12 vertices, but the further statistical analysis isn't possible due to the exponential growth of calculations. The statistical experiments' results are visualised in graphs.