3 papers
cs.DS2026
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…
cs.DB2025
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…
cs.DS2025
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…