The following publications are possibly variants of this publication:
- Fast top-k simple shortest paths discovery in graphsJun Gao, Huida Qiu, Xiao Jiang, Tengjiao Wang, Dongqing Yang. CIKM 2010: 509-518 [doi]
- Efficiently Computing Top-K Shortest Path JoinLijun Chang, Xuemin Lin, Lu Qin, Jeffrey Xu Yu, Jian Pei. edbt 2015: 133-144 [doi]
- Maintaining Constrained Path Problem for Directed Acyclic GraphsChenying Hao, Shurong Zhang, Weihua Yang. join, 21(3), 2021. [doi]
- Note on Path-Connectivity of Complete Bipartite GraphsXiaoxue Gao, Shasha Li, Yan Zhao. join, 22(1), 2022. [doi]