Maximum core spanning tree maintenance for large dynamic graphs

Open Webpage

Xiaowei Lv, Yongcai Wang, Deying Li

Published: 01 Jan 2025, Last Modified: 13 May 2025Theor. Comput. Sci. 2025EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•We are the first to propose an efficient maximum core spanning tree (MCST) dynamic maintenance algorithm.•We investigate a series of properties of MCST and for MCST maintenance.•Extensive evaluations show the proposed MCST maintenance algorithms have good efficiency, scalability, and stability.