1 citations · 1 across the 2 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
quant-ph2022★ 1 cited
Complexity of Eccentricities and All-Pairs Shortest Paths in the Quantum CONGEST Model
ChengSheng Wang, Xudong Wu, Penghui Yao
Computing the distance parameters of a network, including the diameter, radius, eccentricities and the all-pairs shortest paths (APSP) is a central problem in distributed computing…
cs.DC2022
Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks
Xudong Wu, Penghui Yao
This paper studies the round complexity of computing the weighted diameter and radius of a graph in the quantum CONGEST model. We present a quantum algorithm that -approx…