Cover Image

Fair Minimum Labeling: Efficient Temporal Network Activations for Reachability and Equity

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Oettershagen, Lutz, Michail, Othon
Format:	Preprint
Published:	2025
Subjects:	Social and Information Networks Data Structures and Algorithms Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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)

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

Top-k on a Budget: Adaptive Ranking with Weak and Strong Oracles
by: Oettershagen, Lutz
Published: (2026)

Efficient Approximate Temporal Triangle Counting in Streaming with Predictions
by: Venturin, Giorgio, et al.
Published: (2025)

Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification
by: Zhang, Guangyi, et al.
Published: (2026)

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

TGLib: An Open-Source Library for Temporal Graph Analysis
by: Oettershagen, Lutz, et al.
Published: (2022)

Revisiting Information Cascades in Online Social Networks
by: Sidorov, Michael, et al.
Published: (2022)

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

Learn to Vaccinate: Combining Structure Learning and Effective Vaccination for Epidemic and Outbreak Control
by: Elahi, Sepehr, et al.
Published: (2025)

Adaptive Local Clustering over Attributed Graphs
by: Zheng, Haoran, et al.
Published: (2025)

Sublinear-Time Algorithms for Diagonally Dominant Systems and Applications to the Friedkin-Johnsen Model
by: Feng, Weiming, et al.
Published: (2025)

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

On the Robustness of Spectral Algorithms for Semirandom Stochastic Block Models
by: Bhaskara, Aditya, et al.
Published: (2024)

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

Provably Extending PageRank-based Local Clustering Algorithm to Weighted Directed Graphs with Self-Loops and to Hypergraphs
by: Li, Zihao, et al.
Published: (2024)

A Sublinear-Time Spectral Clustering Oracle with Improved Preprocessing Time
by: Shen, Ranran, et al.
Published: (2023)

Weighted Embeddings for Low-Dimensional Graph Representation
by: Bläsius, Thomas, et al.
Published: (2024)

Streaming Stochastic Submodular Maximization with On-Demand User Requests
by: Wang, Honglian, et al.
Published: (2026)

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

Node Similarities under Random Projections: Limits and Pathological Cases
by: Tadić, Tvrtko, et al.
Published: (2024)

HITSnDIFFs: From Truth Discovery to Ability Discovery by Recovering Matrices with the Consecutive Ones Property
by: Chen, Zixuan, et al.
Published: (2023)

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

Temporal Betweenness Centrality on Shortest Walks Variants
by: Naima, Mehdi
Published: (2023)

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

MANTRA: Temporal Betweenness Centrality Approximation through Sampling
by: Cruciani, Antonio
Published: (2023)

Efficient Graph Matching for Correlated Stochastic Block Models
by: Chai, Shuwen, et al.
Published: (2024)

Triadic First-Order Logic Queries in Temporal Networks
by: Bhalerao, Omkar, et al.
Published: (2025)

Hypergraphs as Weighted Directed Self-Looped Graphs: Spectral Properties, Clustering, Cheeger Inequality
by: Li, Zihao, et al.
Published: (2024)

Spectral Toolkit of Algorithms for Graphs: Technical Report (2)
by: Macgregor, Peter, et al.
Published: (2024)

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

Differential Privacy on Trust Graphs
by: Ghazi, Badih, et al.
Published: (2024)

Efficient and Adaptive Estimation of Local Triadic Coefficients
by: Sarpe, Ilie, et al.
Published: (2025)

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

On the Complexity of Community-aware Network Sparsification
by: Herrendorf, Emanuel, et al.
Published: (2024)

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

Enabling Asymptotic Truth Learning in a Social Network
by: Lu, Kevin, 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)