Polynomiality of method for computing graph structure integral descriptor
The relevance of the research is caused by the necessity of developing the efficient method of invariant description and analysis of abstract structures of graph models. The aim of the research is to substantiate the polinomiality of the method for computing the integral descriptor of graph abstract...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
Tomsk Polytechnic University
2019-05-01
|
| Series: | Известия Томского политехнического университета: Инжиниринг георесурсов |
| Subjects: | |
| Online Access: | http://izvestiya.tpu.ru/archive/article/view/1202 |
Search Result 1
Polynomiality of method for computing graph structure integral descriptor
Published 2019-05-01
Get full text
Article