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
Published in:Безопасность информационных технологий
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
Subjects:
primitive graph
primitive matrix
index of primitiveness
Online Access:https://bit.mephi.ru/index.php/bit/article/view/551
Description
Summary: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.
ISSN:2074-7128
2074-7136

Similar Items