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: | Williams, VV (Author), Xu, Y (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
2021-11-09T16:09:27Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Star Coloring of Subcubic Graphs
by: Karthick T., et al.
Published: (2013-05-01) -
Beyond the low-degree algorithm: mixtures of subcubes and their applications
by: Chen, Sitan, et al.
Published: (2021) -
Beyond the low-degree algorithm: mixtures of subcubes and their applications
by: Chen, Sitan, et al.
Published: (2022) -
On locally irregular decompositions of subcubic graphs
by: Olivier Baudon, et al.
Published: (2018-01-01) -
Interval Incidence Coloring of Subcubic Graphs
by: Małafiejska Anna, et al.
Published: (2017-05-01)