DMI is a novel MinHash-based dynamic framework using l-buffered k-MinHash, Bottom-k MinHash, and batch reconstruction for fast approximate maintenance of maximum quasi-cliques in streaming graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Scalable Algorithm for Dynamic Quasi-clique Detection
DMI is a novel MinHash-based dynamic framework using l-buffered k-MinHash, Bottom-k MinHash, and batch reconstruction for fast approximate maintenance of maximum quasi-cliques in streaming graphs.