Polynomial algorithm of computing complete graph invariant on the basis of integral structure descriptor

Polynomial algorithm of computing complete graph invariant on the basis of integral structure descriptor

Show other versions (1)

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...

Full description

Bibliographic Details
Main Authors: V. K. Pogrebnoy, A. V. Pogrebnoy
Format: Article
Language:Russian
Published: Tomsk Polytechnic University 2019-05-01
Series:Известия Томского политехнического университета: Инжиниринг георесурсов
Subjects:
complete graph invariant
graph isomorphism
integral structure descriptor
abstract graph structure
code integration area
polynomial algorithm
Online Access:http://izvestiya-tpu.ru/archive/article/view/1203

Similar Items

Similar Items