12 citations · 59 across the 19 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
cs.DC2020★ 2 cited
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice
Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari +3
We study fundamental graph problems such as graph connectivity, minimum spanning forest (MSF), and approximate maximum (weight) matching in a distributed setting. In particular, we…
cs.DS2020
Near-Optimal Decremental Hopsets with Applications
Jakub Łącki, Yasamin Nazari
Given a weighted undirected graph , a hopset of hopbound and stretch is a set of edges such that for any pair of nodes , there is a path in $…
cs.LG2020★ 9 cited
Faster DBSCAN via subsampled similarity queries
Heinrich Jiang, Jennifer Jang, Jakub Łącki
DBSCAN is a popular density-based clustering algorithm. It computes the -neighborhood graph of a dataset and uses the connected components of the high-degree nodes to decide the…