Year: 2025
Type: preprint
Abstract: We present a parallel variant of Pruned Landmark Labelling (PLL) that is optimised for the preprocessing of hub labels on directed acyclic graphs (DAGs). This method was developed during a seminar at the Karlsruhe Institute of Technology (KIT), focusing on time-expanded graphs that model public transport networks. The approach leverages the topological properties of DAGs to enable a novel parallel construction of hub labels.
Source: arXiv (Cornell University)
Author: Steil, Patrick
Language: English
Topic: Graph Theory and Algorithms
Subfield: Computer Vision and Pattern Recognition
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W6967005380
Cites:
Cited by:
Related to: