Ndist2vec: Node with Landmark and New Distance to Vector Method for Predicting Shortest Path Distance along Road Networks

The ability to quickly calculate or query the shortest path distance between nodes on a road network is essential for many real-world applications. However, the traditional graph traversal shortest path algorithm methods, such as Dijkstra and Floyd–Warshall, cannot be extended to large-scale road ne...

وصف كامل

التفاصيل البيبلوغرافية

المؤلفون الرئيسيون:	Xu Chen, Shaohua Wang, Huilai Li, Fangzheng Lyu, Haojian Liang, Xueyan Zhang, Yang Zhong
التنسيق:	Artigo
اللغة:	Inglês
منشور في:	MDPI AG 2022-10-01
سلاسل:	ISPRS International Journal of Geo-Information
الموضوعات:	road networks shortest path distance landmarks graph embedding neural networks
الوصول للمادة أونلاين:	https://www.mdpi.com/2220-9964/11/10/514
الوسوم:	إضافة وسم لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!