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.

書目詳細資料

發表在:	Безопасность информационных технологий
Main Authors:	S.N. Kyazhin, V. M. Fomichev
格式:	Article
語言:	英语
出版:	Joint Stock Company "Experimental Scientific and Production Association SPELS 2012-03-01
主題:	primitive graph primitive matrix index of primitiveness
在線閱讀:	https://bit.mephi.ru/index.php/bit/article/view/551