Graph-decomposed k-NN searching algorithm on road network  

作　　者：Wei JIANG Bo NING Guanyu LI Mei BAI Xiao JIA Fangliang WEI 

机构地区：[1]Faculty of Information Science and Technology,Dalian Maritime University,Dalian 116026,China [2]Jiangxing Intelligence Inc.,Shenzhen 518100,China

出　　处：《Frontiers of Computer Science》2024年第3期243-245,共3页中国计算机科学前沿（英文版）

基　　金：supported by the National Natural Science Foundation of China(Grant Nos.61976032 and 62002039);the GenReral Scientific Research Project of Liaoning(No.LJKZ0063).

摘　　要：1 Introduction The k-NN(k Nearest Neighbors)searching problem on road network constitutes a crucial aspect of location-oriented services,which has boasted the practical implications.

关 键 词：SERVICES SEARCHING NETWORK 

分 类 号：TP212.9[自动化与计算机技术—检测技术与自动化装置] TN929.5[自动化与计算机技术—控制科学与工程]