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.
Na minha lista:
| Principais autores: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Joint Stock Company "Experimental Scientific and Production Association SPELS
2012-03-01
|
| coleção: | Безопасность информационных технологий |
| Assuntos: | |
| Acesso em linha: | https://bit.mephi.ru/index.php/bit/article/view/551 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|
