1 citations · 1 across the 1 of their papers we have counts for
2 papers
quant-ph2026★ 1 cited
Advances in quantum algorithms for the shortest path problem
Adam WesoÅowski, Stephen Piddock
Given an undirected, weighted graph, with vertices and edges, and two special vertices and , the problem is to find the shortest path between them. We give two bound…
quant-ph2025
Quantum algorithms and lower bounds for eccentricity, radius, and diameter in undirected graphs
Adam WesoÅowski, Jinge Bao
The problems of computing eccentricity, radius, and diameter are fundamental to graph theory. These parameters are intrinsically defined based on the distance metric of the graph.…