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.
External IDs:dblp:journals/isci/BaiZJ26
Loading