Work

An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs

Year: 2025

Type: conference-paper

Abstract: We prove that the single-source shortest-path problem on disk graphs can be solved in $O(n\log n)$ time, and that it can be solved on intersection graphs of fat triangles in $O(n\log^2 n)$ time.

Source: TU/e Research Portal

DOI: 10.4230/lipics.esa.2025.81

Authors: de Berg, Mark, Cabello, Sergio

Institutions: Eindhoven University of Technology, University of Ljubljana, Institute of Mathematics, Physics, and Mechanics

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: European Commission, Nederlandse Organisatie voor Wetenschappelijk Onderzoek

Awards: G5099342464, G565383568, G725356751

OpenAlex ID: W7141641196

FWCI:

Cites:

Cited by:

Related to: