1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DB2024★ 1 cited
Efficient k-step Weighted Reachability Query Processing Algorithms
Congquan Mei, Lian Chen, Junfeng Zhou +4
Given a data graph G, a source vertex u and a target vertex v of a reachability query, the reachability query is used to answer whether there exists a path from u to v in G. Reacha…
cs.DB2022
Efficient Reachability Ratio Computation for 2-hop Labeling Scheme
Junfeng Zhou, Xian Tang, Ming Du
As one of the fundamental graph operations, reachability queries processing has been extensively studied during the past decades. Many approaches followed the line of designing 2-h…