Irina E. Numerical graphs optimal representation problems solving and effectiv algorithms construction conditions investigation.

Українська версія

Thesis for the degree of Candidate of Sciences (CSc)

State registration number

0404U001783

Thesis Registration Form

0404U001783.pdf

Applicant for

Specialization

  • 01.05.01 - Теоретичні основи інформатики та кібернетики

17-10-2003

Specialized Academic Board

Д 26.194.02

V.M. Glushkov Institute of Cybernetics of National Academy of Sciences of Ukraine

Essay

The dissertation is devoted to numerical graphs investigation and application of their properties for construction above ones efficient algorithms. Numerical graphs subclasses as arithmetical and modular are considered. It is proved, that any graph can be represented in given graph class. Homogeneous natural arithmetical graphs are completely described and tables, which permit to reproduce ones graphs with given parameters are calculated.

Read more

Files

aref.doc

dissertation.doc

Similar theses

0421U102388

Nasirov Emil Mekhdiievych

Parallelization of non-negative huge sparse linguistic matrix and tensors factorization

0420U102355

Dudar Vyacheslav Vyacheslavovych

Training algorithms and invariance to geometric transformations of neural networks

0520U101700

Prytomanova Olga M.

Fuzzy problems of optimal set partitioning: theoretical bases, methods and algorithms for solving

0520U100242

Zavadskyi Ihor O.

Splittable codes and their applications

0520U100209

Rystsov Ihor

Application of algebraic automata theory to analysis of discrete dynamical systems.