Другие журналы

Ovchinnikov
Completely Described Undirected Graph Structure
Engineering Education # 04, April 2016 DOI: 10.7463/0416.0835978 pp. 106123
Systematization of Accurate Discrete Optimization Methods
Engineering Education # 06, June 2015 DOI: 10.7463/0615.0778982 pp 288304
Evaluation of efficiency of optimizing transformation for algorithms of ultragraph operations
Engineering Education # 01, January 2013 DOI: 10.7463/0113.0547731 In this article the authors consider experimental evaluation of reducing computational complexity of algorithms of ultragraph operations. According to the results of theoretical analysis of the algorithms of ultragraph 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%.
7730569/239406 Evaluation the effectiveness of ordered set operations
Engineering Education # 10, October 2011 The efficiency of using ordered set operations is considered by example of partitioning a complex system structure into subsystems. The article considers a formal definition of this problem as separation of the hypergraph vertex set into disjoint subsets. The article describes the main design routines of computer scheme partitioning by sequential algorithm. The partitioning process was fulfilled by using unordered and ordered set operations. The computation complexity assessment of both member functions was fulfilled. The efficiency of using ordered set operations may be proportional to the quantity of network elements.
A hypergraps operations application for partitioning networks
Engineering Education # 07, July 2011 In this paper, we present the two realizations networks partitioning: in set operations and with using hypergraph operations. The second variant partitioning description is more compact and clear. The asymptotic computation complexity of both realizations is equal. The formal description of multilevel hypergraph partitioning is received. This description make possible easily to estimate the transformations that demand very large quantity actions.
Ordered set operations
Engineering Education # 06, June 2011 The decisive rules of algorithms execution ordered set operations are substantiated. Conditions for achieving maximum of multitude elements comparisons are formulated. The asymptotic computation complexities of operations are received. The efficiency of using ordered set operations is estimated.
Operations over ultra and hypercolumns for realisation of procedures of the analysis and synthesis of structures of difficult systems (Part 3)
Engineering Education # 12, December 2009
Some operations reforming ultra and
hypergraphs are considered. These operations realize project procedures of analysis
and synthesis the complex system structure using their mathematical models.
Operations over ultra and hypercolumns for realisation of procedures of the analysis and synthesis of structures of difficult systems (Part 2)
Engineering Education # 11, November 2009 Some operations reforming ultra and hypergraphs are considered. These operations realize project procedures of analysis and synthesis the complex system structure using their mathematical models
Operations over ultra and hypercolumns for realisation of procedures of the analysis and synthesis of structures of difficult systems
Engineering Education # 10, October 2009 Some operations reforming ultra and hypergraphs are considered. These operations realize project procedures of analysis and synthesis the complex system structure using their mathematical models.
The mathematical models of objects for structural creation tasks
Engineering Education # 03, March 2009
In this paper, the unified concept of ultra, hyper and usual directed and un directed graph is given. The connection between this types of graph models is shown. The formal rules for matrix and analytical representations each type of graph are cited.



