Maximum core spanning tree maintenance for large dynamic graphs

DOI10.1016/J.TCS.2025.115278MaRDI QIDQ6985806zbMATH OpenFDO

Authors Xiaowei Lv, Yongcai Wang, Deying Li

Publication date 12 May 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115278

zbMATH Keywords

dense subgraph miningdynamic maintenancemaximum core spanning tree

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Cites work

• k-Degenerate Graphs
• Arboricity and Subgraph Listing Algorithms
• Cohesive subgraph computation over large sparse graphs. Algorithms, data structures, and programming techniques
• scientific article; zbMATH DE number 3906496 (Why is no real title available?)
• scientific article; zbMATH DE number 1926664 (Why is no real title available?)
• scientific article; zbMATH DE number 6472606 (Why is no real title available?)
• Maintaining minimum spanning trees in dynamic graphs
• Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
• Smallest-last ordering and clustering and graph coloring algorithms
• Triangle listing algorithms: back from the diversion

This page was built for publication: Maximum core spanning tree maintenance for large dynamic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6985806)