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.

This past October, as Jacob Holm and Eva Rotenberg were thumbing through a paper they’d posted a few months earlier, they realized they had been sitting on something big. For decades computer ...