The paper considers a project scheduling problem in weighted directed graphs in which arcs represent operations while nodes are identified with starting and finishing endpoints of the operations; arc ...

Quantitative Improvement Old Bound (Dijkstra): O (m+nlog⁡n)O (m+nlogn) New Bound: O (mlog⁡2/3n)O (mlog2/3n) For sparse graphs where mm is about O (n)O (n), this is asymptotically faster as nn grows.

The team proposed Graph-Decomposed k -NN Searching Algorithm to improve the time-efficiency of nearest nodes searching. In the research, A graph-decomposed tree is constructed from road network.