Cover Image

On the Complexity of Community-aware Network Sparsification

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Herrendorf, Emanuel, Komusiewicz, Christian, Morawietz, Nils, Sommer, Frank
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Social and Information Networks
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial
by: Komusiewicz, Christian, et al.
Published: (2026)

Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set
by: Herrmann, Anton, et al.
Published: (2025)

Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problems
by: Grüttemeier, Niels, et al.
Published: (2025)

Complexity of Local Search for Euclidean Clustering Problems
by: Manthey, Bodo, et al.
Published: (2023)

inGRASS: Incremental Graph Spectral Sparsification via Low-Resistance-Diameter Decomposition
by: Aghdaei, Ali, et al.
Published: (2024)

A Multivariate Complexity Analysis of the Generalized Noah's Ark Problem
by: Komusiewicz, Christian, et al.
Published: (2023)

Witty: An Efficient Solver for Computing Minimum-Size Decision Trees
by: Staus, Luca Pascal, et al.
Published: (2024)

Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance
by: Chang, Lijun
Published: (2024)

Effective Individual Fairest Community Search over Heterogeneous Information Networks
by: Zhao, Taige, et al.
Published: (2024)

Towards Settling the Complexity of the Lettericity Problem
by: Grobler, Mario, et al.
Published: (2026)

Profit Maximization in Closed Social Networks
by: Sharma, Poonam, et al.
Published: (2026)

Inferring Tie Strength in Temporal Networks
by: Oettershagen, Lutz, et al.
Published: (2022)

An Edge-Based Decomposition Framework for Temporal Networks
by: Oettershagen, Lutz, et al.
Published: (2023)

Enabling Asymptotic Truth Learning in a Social Network
by: Lu, Kevin, et al.
Published: (2024)

Efficient Sampling of Temporal Networks with Preserved Causality Structure
by: Stamm, Felix I., et al.
Published: (2025)

Opinion Maximization in Social Networks by Modifying Internal Opinions
by: Wang, Gengyu, et al.
Published: (2025)

A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation
by: Hashemi, Mohammad, et al.
Published: (2024)

Overcoming Non-Submodularity: Towards Constant Approximation for Network Immunization
by: Srivastava, Ajitesh, et al.
Published: (2024)

Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
by: Chen, Jingbang, et al.
Published: (2024)

Counting Balanced Triangles on Social Networks With Uncertain Edge Signs
by: Zhou, Alexander, et al.
Published: (2026)

Catch Me If You Can: Finding the Source of Infections in Temporal Networks
by: Bals, Ben, et al.
Published: (2024)

Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation
by: Bläsius, Thomas, et al.
Published: (2024)

On the accurate computation of expected modularity in probabilistic networks
by: Shen, Xin, et al.
Published: (2024)

On Computing Optimal Tree Ensembles
by: Komusiewicz, Christian, et al.
Published: (2023)

Parallel Algorithms for Median Consensus Clustering in Complex Networks
by: Hussain, Md Taufique, et al.
Published: (2024)

Outperforming Dijkstra on Sparse Graphs: The Lightning Network Use Case
by: Valko, Danila, et al.
Published: (2025)

Foremost, Fastest, Shortest: Temporal Graph Realization under Various Path Metrics
by: Cauvi, Justine, et al.
Published: (2025)

Realization of Temporally Connected Graphs Based on Degree Sequences
by: Casteigts, Arnaud, et al.
Published: (2025)

A Fully-dynamic Approximation Algorithm for Maximum Weight b-Matchings in Graphs
by: Brandt-Tumescheit, Fabian, et al.
Published: (2024)

Fast Estimation of Percolation Centrality
by: Cruciani, Antonio
Published: (2024)

On Densest $k$-Subgraph Mining and Diagonal Loading: Optimization Landscape and Finite-Step Exact Convergence Analysis
by: Lu, Qiheng, et al.
Published: (2024)

Optimizing Probabilistic Propagation in Graphs by Adding Edges
by: Bhaskara, Aditya, et al.
Published: (2024)

A novel DFS/BFS approach towards link prediction
by: Dörpinghaus, Jens, et al.
Published: (2024)

Consistent Tie-Strength Labeling for Multilayer Strong Triadic Closure
by: Oettershagen, Lutz, et al.
Published: (2024)

Local Centrality Minimization with Quality Guarantees
by: Miyauchi, Atsushi, et al.
Published: (2024)

Influence Maximization in Hypergraphs by Stratified Sampling for Efficient Generation of Reverse Reachable Sets
by: Zhang, Lingling, et al.
Published: (2024)

Scalable Temporal Motif Densest Subnetwork Discovery
by: Sarpe, Ilie, et al.
Published: (2024)

Graph Discovery and Source Detection in Temporal Graphs
by: Bals, Ben
Published: (2025)

ProbeWalk: Fast Estimation of Biharmonic Distance on Graphs via Probe-Driven Random Walks
by: Zheng, Dehong, et al.
Published: (2025)

Multilevel Digital Contact Tracing
by: Mahapatra, Gautam, et al.
Published: (2020)