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

• Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance
• Collective dynamics of ‘small-world’ networks
• Potential games
• Title not available (Why is that?)
• Better Approximation of Betweenness Centrality
• The hardness of the closest vector problem with preprocessing
• Networks
• Triangle Listing Algorithms: Back from the Diversion
• Untangling the Hairballs of Multi-Centered, Small-World Online Social Media Networks
• Title not available (Why is that?)
• Uncertain Graph Processing through Representative Instances
• Edge sampling and graph parameter estimation via vertex neighborhood accesses

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)