4 citations · 6 across the 7 of their papers we have counts for
7 papers
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…
BatchHL: Answering Distance Queries on Batch-Dynamic Networks at Scale
Muhammad Farhan, Qing Wang, Henning Koehler
Many real-world applications operate on dynamic graphs that undergo rapid changes in their topological structure over time. However, it is challenging to design dynamic algorithms…
Efficient Maintenance of Distance Labelling for Incremental Updates in Large Dynamic Graphs
Muhammad Farhan, Qing Wang
Finding the shortest path distance between an arbitrary pair of vertices is a fundamental problem in graph theory. A tremendous amount of research has been successfully attempted o…
A Highly Scalable Labelling Approach for Exact Distance Queries in Complex Networks
Muhammad Farhan, Qing Wang, Yu Lin +1
Answering exact shortest path distance queries is a fundamental task in graph theory. Despite a tremendous amount of research on the subject, there is still no satisfactory solutio…