Abstract: All-pairs shortest paths (APSP) remains a major bottleneck for large-scale graph analytics, as data movement with cubic complexity overwhelms the bandwidth of conventional memory hierarchies ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results