Kokhov V. (Moscow Power Engineering Institute (National Research University))
|
28 classes of determining the T-digraphs’ similarity problem are suggested. The methodology of solving the problems, which includes three approaches based on: 1) supergraphs; 2) maximum common fragments; 3) supergraphs invariants is proposed. A procedure of constructing the system of supergraphs, which takes into account half-path arrangement information, is described. Examples of solving the problems are given.
Keywords:Temporal digraph. Invariant. Supergraph. Similarity problem.
|
|
|
Read the full article …
|
Citation link: Kokhov V. Problems and methods of temporal digraphs similarity determining // Современная наука: актуальные проблемы теории и практики. Серия: Естественные и Технические Науки. -2016. -№02. -С. 44-51 |
|
|