Algorithms for the truss maintenance problem on edge-weighted graphs

DOI10.1142/S0129054123460036MaRDI QIDQ6955219zbMATH OpenFDO

Authors Bin Liu, Zhenming Liu, Feiteng Zhang

Publication date 23 July 2025

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054123460036

zbMATH Keywords

community searchdynamic graphedge-weighted graphstruss maintenance

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Social networks; opinion dynamics (91D30)

Cites work

• A graph‐theoretic generalization of the clique concept
• An order approach for the core maintenance problem on edge-weighted graphs
• Fast algorithms for determining (generalized) core groups in social networks

This page was built for publication: Algorithms for the truss maintenance problem on edge-weighted graphs

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