:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Berner, Lukas, Meyerhenke, Henning
Format:	Preprint
Published:	2024
Subjects:	Social and Information Networks
Online Access:	https://arxiv.org/abs/2407.11521
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Unified Framework for Complex Graph-Data: Introducing the Hybrid Layered Network Model
by: Chatterjee, Shraban Kumar, et al.
Published: (2023)

Link Prediction on Textual Edge Graphs
by: Ling, Chen, et al.
Published: (2024)

Effective Edge-wise Representation Learning in Edge-Attributed Bipartite Graphs
by: Wang, Hewen, et al.
Published: (2024)

PoliTok-DE: A Multimodal Dataset of Political TikToks and Deletions From Germany
by: Ruiz, Tomas, et al.
Published: (2025)

Skyline Community Search over Edge-Attributed Bipartite Graphs
by: Guo, Fangda, et al.
Published: (2024)

Edge Classification on Graphs: New Directions in Topological Imbalance
by: Cheng, Xueqi, et al.
Published: (2024)

Harmonizing vs Polarizing Platform Influence Functions
by: AlMahmoud, Hind, et al.
Published: (2024)

GitHub Stargazers | Building Graph- and Edge-level Prediction Algorithms for Developer Social Networks
by: Thakrar, Karishma, et al.
Published: (2025)

Robust Multimodal Recommendation via Graph Retrieval-Enhanced Modality Completion
by: Li, Yuan, et al.
Published: (2026)

Empirical Evaluation of Link Deletion Methods for Limiting Information Diffusion on Social Media
by: Furukawa, Shiori, et al.
Published: (2026)

On the Preservation of Input/Output Directed Graph Informativeness under Crossover
by: Pape, Andreas Duus, et al.
Published: (2024)

Robust Deep Signed Graph Clustering via Weak Balance Theory
by: Zhao, Peiyao, et al.
Published: (2025)

Robust Reward Placement under Uncertainty
by: Petsinis, Petros, et al.
Published: (2024)

Robustness Evaluation of Graph-based News Detection Using Network Structural Information
by: Zeng, Xianghua, et al.
Published: (2025)

Minimal Construction of Graphs with Maximum Robustness
by: Lee, Haejoon, et al.
Published: (2025)

Reviving Life on the Edge: Joint Score-Based Graph Generation of Rich Edge Attributes
by: Berman, Nimrod, et al.
Published: (2024)

How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs
by: Deligkas, Argyrios, et al.
Published: (2024)

Hierarchical-Graph-Structured Edge Partition Models for Learning Evolving Community Structure
by: Yu, Xincan, et al.
Published: (2024)

Robust Graph Contrastive Learning with Information Restoration
by: Zhu, Yulin, et al.
Published: (2023)

GraphMU: Repairing Robustness of Graph Neural Networks via Machine Unlearning
by: Wu, Tao, et al.
Published: (2024)

Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better
by: Balmaseda, Vicente, et al.
Published: (2024)

Synthetic Networks That Preserve Edge Connectivity
by: Anne, Lahari, et al.
Published: (2024)

Enhance Stability of Network by Edge Anchor
by: Qiu, Hongbo, et al.
Published: (2025)

Scalable Signed Exponential Random Graph Models under Local Dependence
by: Schalberger, Marc, et al.
Published: (2025)

Finding Densest Subgraphs with Edge-Color Constraints
by: Oettershagen, Lutz, et al.
Published: (2024)

Burger: Robust Graph Denoising-augmentation Fusion and Multi-semantic Modeling in Social Recommendation
by: Lan, Yuqin, et al.
Published: (2025)

Understanding the Robustness of Graph Neural Networks against Adversarial Attacks
by: Wu, Tao, et al.
Published: (2024)

Robust Ante-hoc Graph Explainer using Bilevel Optimization
by: Luong, Kha-Dinh, et al.
Published: (2023)

Effective Edge Centrality via Neighborhood-based Optimization
by: Yang, Renchi
Published: (2024)

Accurate Link Prediction for Edge-Incomplete Graphs via PU Learning
by: Kim, Junghun, et al.
Published: (2024)

Maximum Edge-based Quasi-Clique: Novel Iterative Frameworks
by: Xia, Hongbo, et al.
Published: (2026)

Detecting Patterns of Interaction in Temporal Hypergraphs via Edge Clustering
by: DeWolfe, Ryan, et al.
Published: (2025)

Topologically-Stabilized Graph Neural Networks: Empirical Robustness Across Domains
by: Losic, Jelena
Published: (2025)

A Hierarchical Scale-free Graph Generator under Limited Resources
by: Qi, Xiaorui, et al.
Published: (2024)

Cohesive Group Discovery in Interaction Graphs under Explicit Density Constraints
by: Zhang, Yu, et al.
Published: (2025)

Structure-Preference Enabled Graph Embedding Generation under Differential Privacy
by: Zhang, Sen, et al.
Published: (2025)

GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems
by: Wu, Xinyi, et al.
Published: (2024)

Reducing COVID-19 Misinformation Spread by Introducing Information Diffusion Delay Using Agent-based Modeling
by: Alassad, Mustafa, et al.
Published: (2024)

HOT: Higher-Order Dynamic Graph Representation Learning with Efficient Transformers
by: Besta, Maciej, et al.
Published: (2023)