Scalable Approximate Algorithm for Dynamic Densest Subhypergraphs with Solution-Guided Maintenance
Hypergraphs model interactions involving groups of entities, and finding highly connected groups is a fundamental task in analyzing these data. When interactions arrive and expire, maintaining a dense group can require frequent and expensive changes to the underlying representation. We propose CAP, a scalable algorithm...