Algorithm solves single-source shortest-paths efficiently in disk graphs, indicating practical implications for graph analysis.
We prove that the single-source shortest-path problem on disk graphs can be solved in O(n log n) expected time, and that it can be solved on intersection graphs of fat triangles in O(n log³ n) time.
No takes yet. Share an insight, caveat, or question.
Berg et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: