Da Yan

activity

20162020

most citedLightweight Fault Tolerance in Large-Scale Distributed Graph Processing

8 citations · 12 across the 6 of their papers we have counts for

collaborators

Showing 2020 · cs.DCShow all

1 paper · 2 filters

cs.DC2020★ 3 cited

Scalable Mining of Maximal Quasi-Cliques: An Algorithm-System Codesign Approach

Guimu Guo, Da Yan, M. Tamer Özsu +2

Given a user-specified minimum degree threshold $γ$ , a $γ$ -quasi-clique is a subgraph $g = (V_{g}, E_{g})$ where each vertex $v \in V_{g}$ connects to at least $γ$ fraction of the other vert…