In a new hybrid network model combining LOCAL and node-capacitated clique communication, APSP is solved exactly in O~(n^{2/3}) rounds, approximately in Θ~(√n) rounds, and SSSP exactly in O~(√SPD) rounds.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Shortest Paths in a Hybrid Network Model
In a new hybrid network model combining LOCAL and node-capacitated clique communication, APSP is solved exactly in O~(n^{2/3}) rounds, approximately in Θ~(√n) rounds, and SSSP exactly in O~(√SPD) rounds.