2 citations · 2 across the 2 of their papers we have counts for
3 papers
cs.DB2022
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…
cs.DS2021★ 2 cited
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…
cs.DS2018
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…