Pavlov

 In this article the authors consider experimental evaluation of reducing computational complexity of algorithms of ultra-graph operations. According to the results of theoretical analysis of the algorithms of ultra-graph operations, procedures, which introduce the greatest contribution to their computational complexity, were defined; ways of its reducing were selected. With the help of special software contribution of optimizing transformations to reducing computational complexity of vertex addition was estimated. Experimental results showed high efficiency of the conversion process - total reduction of computational complexity of the algorithm was up to 87%.