2 papers
cs.DB2022
Efficiently Answering Quality Constrained Shortest Distance Queries in Large Graphs
You Peng, Zhuo Ma, Wenjie Zhang +3
The shortest-path distance is a fundamental concept in graph analytics and has been extensively studied in the literature. In many real-world applications, quality constraints are…
cs.LO2020
A Framework to Quantify Approximate Simulation on Graph Data
Xiaoshuang Chen, Longbin Lai, Lu Qin +2
Simulation and its variants (e.g., bisimulation and degree-preserving simulation) are useful in a wide spectrum of applications. However, all simulation variants are coarse "yes-or…