10 citations · 38 across the 37 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020
Dynamic Approximate Maximum Independent Set on Massive Graphs
Xiangyu Gao, Jianzhong Li, Dongjing Miao
Computing a maximum independent set (MaxIS) is a fundamental NP-hard problem in graph theory, which has important applications in a wide spectrum of fields. Since graphs in many ap…
cs.DS2018★ 5 cited
An Algorithm for Reducing Approximate Nearest Neighbor to Approximate Near Neighbor with O(logn) Query Time
Hengzhao Ma, Jianzhong Li
This paper proposes a new algorithm for reducing Approximate Nearest Neighbor problem to Approximate Near Neighbor problem. The advantage of this algorithm is that it achieves O(lo…