Polynomial algorithm of computing complete graph invariant on the basis of integral structure descriptor
The relevance of the research is caused by the unsolved problem of searching for the complete graph invariant and polynomial algorithm for its computing. The aim of the research is in determining the complete invariant of an ordinary graph on the basis of integral descriptor of abstract structure an...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
Tomsk Polytechnic University
2019-05-01
|
| Series: | Известия Томского политехнического университета: Инжиниринг георесурсов |
| Subjects: | |
| Online Access: | http://izvestiya-tpu.ru/archive/article/view/1203 |
Search Result 1
Polynomial algorithm of computing complete graph invariant on the basis of integral structure descriptor
Published 2019-05-01
Get full text
Article