Truly subcubic min-plus product for less structured matrices, with applications
Copyright © 2020 by SIAM The All-Pairs Shortest Paths (APSP) problem is one of the most basic problems in computer science. The fastest known algorithms for APSP in n-node graphs run in n3−o(1) time, and it is a big open problem whether a truly subcubic, O(n3−ε) for ε > 0 time algorithm exists fo...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2021-11-09T16:09:27Z.
|
| Subjects: | |
| Online Access: | Get fulltext |