pith. sign in

Title resolution pending

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

fields

cs.SI 1

years

2026 1

verdicts

UNVERDICTED 1

clear filters

representative citing papers

Scalable Algorithm for Dynamic Quasi-clique Detection

cs.SI · 2026-05-25 · unverdicted · novelty 7.0

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.

citing papers explorer

Showing 1 of 1 citing paper after filters.

  • Scalable Algorithm for Dynamic Quasi-clique Detection cs.SI · 2026-05-25 · unverdicted · none · ref 59

    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.