Cover Image

Equalizing Closeness Centralities via Edge Additions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Crane, Alex, Friedler, Sorelle A., Patel, Mihir, Sullivan, Blair D.
Format:	Preprint
Published:	2025
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

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

Overlapping and Robust Edge-Colored Clustering in Hypergraphs
by: Crane, Alex, et al.
Published: (2023)

Aggregating maximal cliques in real-world graphs
by: Alon, Noga, et al.
Published: (2025)

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

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

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

An Improved Combinatorial Algorithm for Edge-Colored Clustering in Hypergraphs
by: Han, Seongjune, et al.
Published: (2026)

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

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

Correlation Clustering with Vertex Splitting
by: Bentert, Matthias, et al.
Published: (2024)

Fast Percolation Centrality Approximation with Importance Sampling
by: Cruciani, Antonio, et al.
Published: (2025)

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

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

Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges
by: Crane, Alex, et al.
Published: (2025)

Structural Optimal Jacobian Accumulation and Minimum Edge Count are NP-Complete Under Vertex Elimination
by: Bentert, Matthias, et al.
Published: (2025)

Fast Approximate CoSimRanks via Random Projections
by: Yang, Renchi, et al.
Published: (2020)

Locally Differentially Private Graph Clustering via the Power Iteration Method
by: Suppakitpaisarn, Vorapong, et al.
Published: (2025)

Mixing Time Matters: Accelerating Effective Resistance Estimation via Bidirectional Method
by: Cui, Guanyu, et al.
Published: (2025)

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

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

The Vertex-Attribute-Constrained Densest $k$-Subgraph Problem
by: Lu, Qiheng, et al.
Published: (2025)

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

Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets
by: Basu, Sabyasachi, et al.
Published: (2024)

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

An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale
by: Spaeh, Fabian, et al.
Published: (2025)

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

Towards Tight Bounds for Estimating Degree Distribution in Streaming and Query Models
by: Bishnu, Arijit, et al.
Published: (2025)

A Spanning-Tree-Based Algorithm for Planar Graph Dismantling
by: You, Fangchen
Published: (2025)

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

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

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

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

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

Finding coherent node groups in directed graphs
by: Kumpulainen, Iiro, et al.
Published: (2023)

Linear-Time Exact Computation of Influence Spread on Bounded-Pathwidth Graphs
by: Nakamura, Kengo, et al.
Published: (2026)

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

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

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

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

On the External Validity of Average-Case Analyses of Graph Algorithms
by: Bläsius, Thomas, et al.
Published: (2022)