Generic network sparsification via degree- and subgraph-based edge sampling

DOI10.1016/J.INS.2024.121096MaRDI QIDQ6576963FDOQ6576963

Authors Zhen Su, Yang Liu, J. Kurths, Henning Meyerhenke

Publication date 23 July 2024

Published in Information Sciences (Search for Journal in Brave)

zbMATH Keywords

network analysisedge samplingtriadsgraph sparsification

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites work

• scientific article; zbMATH DE number 3910446 (Why is no real title available?)
• Better approximation of betweenness centrality
• Collective dynamics of `small-world' networks
• Edge sampling and graph parameter estimation via vertex neighborhood accesses
• Edge sampling using local network information
• Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance
• Networks
• Potential games
• The hardness of the closest vector problem with preprocessing
• Triangle listing algorithms: back from the diversion
• Uncertain Graph Processing through Representative Instances
• Untangling the hairballs of multi-centered, small-world online social media networks

This page was built for publication: Generic network sparsification via degree- and subgraph-based edge sampling

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