Dense subgraph mining in dynamic bipartite graphs

Published: 2026, Last Modified: 05 Nov 2025Inf. Sci. 2026EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•We establish a rigorous theoretical framework to guarantee the correctness of k-bitruss maintenance.•We propose effective algorithms to handle insertion and removal cases, addressing dynamic graph maintenance challenges.•We construct a novel BS-index to eliminate redundant computations and significantly enhance algorithm performance.
Loading