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.

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 ...

“The new algorithm is a remarkable tour de force,” said Giuseppe Italiano, a computer scientist at Luiss University and a co-author of the 1996 paper describing what is now the second-fastest ...