Warianty tytułu
Języki publikacji
Abstrakty
In the process of complex objects and systems design the graph and multiple models of their structures are widely applied. Representation of structure models in a form of binary trees is the most economical and optimal for a number of databases designing and creating tasks. Parallel reduction is one of the best methods of binary trees formation. The complexity assessment of basic formation procedure of the reduction binary tree for complex objects (especially with significantly irregular structure) results in О(n3), which causes problems in the process of solving the large dimension tasks, where n is the number of system elements. It is possible to reduce the task complexity artificially increasing parallelism of the reduction process. Several studies have revealed the possibility to reduce the task complexity assessment up to О(n2) without any loss of the result quality.
Czasopismo
Rocznik
Tom
Strony
85-90
Opis fizyczny
Bibliogr. 3 poz., wykr.
Twórcy
autor
- Lviv Polytechnic National University, sptkach@gmail.com
autor
- Lviv Polytechnic National University
autor
- Center of Information Support
autor
- Lviv Polytechnic National University
Bibliografia
- 1. Tevet, J.-T., 2012, Semiotic Modelling of the Graphs, available at: www.graphs.ee
- 2. Tkachenko, S., Solomko, I., 2013, Sufficient Conditions of Equivalence Subgraphs by Solving Decomposition Problems, CADSM ‘2013, 366-367, 2013.
- 3. Tkachenko, S., Soprunyuk, O., Tkachenko, V., Yatsyk, N., 2013, Fast formation of Binary Trees as Parallel (Optimal) Reduction Process Models, CADMD'2013, 49.
Typ dokumentu
Bibliografia
Identyfikatory
Identyfikator YADDA
bwmeta1.element.baztech-655d67c4-9916-4d40-9e07-cea1f399003e