The following publications are possibly variants of this publication:
- When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road NetworksDian Ouyang, Lu Qin, Lijun Chang, Xuemin Lin, Ying Zhang, Qing Zhu. SIGMOD 2018: 709-724 [doi]
- Double Hierarchical Labeling Shortest Distance Querying in Time-dependent Road NetworksTangpeng Dan, Xiao Pan, Bolong Zheng, Xiaofeng Meng 0001. icde 2023: 2077-2089 [doi]
- Compression techniques for 2-hop labeling for shortest distance queriesShikha Anirban, Junhu Wang, Md. Saiful Islam 0003, Humayun Kayesh, Jianxin Li 0001, Mao Lin Huang. www, 25(1):151-174, 2022. [doi]
- To Meet or Not to Meet: Finding the Shortest Paths in Road NetworksWeihuang Huang, Yikai Zhang 0001, Zechao Shang, Jeffrey Xu Yu. tkde, 30(4):772-785, 2018. [doi]