Analysis Algorithms of Primitiveness of the Directed Graphs

Analysis Algorithms of Primitiveness of the Directed Graphs

Algorithms of determination of an index of primitiveness of the directed finite graph by means of depth-first search on the column and exponentiations of a connectivity matrix of peaks are constructed. Computing complexity of the offered algorithms is estimated.

Bibliographic Details
Main Authors: S.N. Kyazhin, V. M. Fomichev
Format: Article
Language:English
Published: Joint Stock Company "Experimental Scientific and Production Association SPELS 2012-03-01
Series:Безопасность информационных технологий
Subjects:
primitive graph
primitive matrix
index of primitiveness
Online Access:https://bit.mephi.ru/index.php/bit/article/view/551

Similar Items

Similar Items