当前位置: X-MOL 学术Theory Comput. Syst. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Improved Distance Queries and Cycle Counting by Frobenius Normal Form.
Theory of Computing Systems ( IF 0.6 ) Pub Date : 2018-11-21 , DOI: 10.1007/s00224-018-9894-x
Piotr Sankowski 1 , Karol Węgrzycki 1
Affiliation  

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 \(\widetilde {O}(n^{\omega })\). The framework is based on the fast decomposition into Frobenius normal form and the Hankel matrix-vector multiplication. It allows us to solve the All-Nodes Shortest Cycles, All-Pairs All Walks problems efficiently and also give some improvement upon distance queries in unweighted graphs.

中文翻译:

通过Frobenius范式改进了距离查询和周期计数。

考虑未加权,有向图G ^与直径d。在本文中,我们介绍了在矩阵乘法时间\(\ widetilde {O}(n ^ {\ omega})\)中计算给定长度的周期和步数的框架。该框架基于快速分解为Frobenius范式和Hankel矩阵向量乘法。它使我们能够有效地解决“所有节点最短周期,所有对所有步行”的问题,并且还可以改善未加权图中的距离查询。
更新日期:2018-11-21
down
wechat
bug