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: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Moscow Engineering Physics Institute
2012-03-01
|
| Series: | Bezopasnostʹ Informacionnyh Tehnologij |
| Subjects: | |
| Online Access: | https://bit.mephi.ru/index.php/bit/article/view/551 |