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.

Abstractions blog A New Algorithm for Graph Crossings, Hiding in Plain Sight Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory ...