Lixiang Qian

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Given an unweighted and undirected graph, this paper aims to give a tight distributed algorithm for computing the all pairs shortest paths (APSP) under synchronous communications and the CONGEST(B) model, where each node can only transfer B bits of information along each incident edge in a round. The best previous results for distributively computing APSP(More)
  • 1