Cargando…
Improved Distance Queries and Cycle Counting by Frobenius Normal Form
Consider an unweighted, directed graph G with the diameter D. In this paper, we introduce the framework for counting cycles and walks of given length in matrix multiplication time [Formula: see text] . The framework is based on the fast decomposition into Frobenius normal form and the Hankel matrix-...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2018
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6647240/ https://www.ncbi.nlm.nih.gov/pubmed/31396014 http://dx.doi.org/10.1007/s00224-018-9894-x |