5 papers
Optimized Customizable Route Planning in Large Road Networks with Batch Processing
Muhammad Farhan, Henning Koehler
Modern route planners such as Google Maps and Apple Maps serve millions of users worldwide, optmizing routes in large-scale road networks where fast responses are required under di…
Accelerating Maximum Common Subgraph Computation by Exploiting Symmetries
Buddhi Kothalawala, Henning Koehler, Muhammad Farhan
The Maximum Common Subgraph (MCS) problem plays a key role in many applications, including cheminformatics, bioinformatics, and pattern recognition, where it is used to identify th…
Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks
Muhammad Farhan, Henning Koehler, Qing Wang
Computing the shortest-path distance between any two given vertices in road networks is an important problem. A tremendous amount of research has been conducted to address this pro…
Stable Tree Labelling for Accelerating Distance Queries on Dynamic Road Networks
Henning Koehler, Muhammad Farhan, Qing Wang
Finding the shortest-path distance between two arbitrary vertices is an important problem in road networks. Due to real-time traffic conditions, road networks undergo dynamic chang…
Hierarchical Cut Labelling -- Scaling Up Distance Queries on Road Networks
Muhammad Farhan, Henning Koehler, Robert Ohms +1
Answering the shortest-path distance between two arbitrary locations is a fundamental problem in road networks. Labelling-based solutions are the current state-of-the-arts to rende…