:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Cui, Guanyu, Wang, Hanzhi, Wei, Zhewei
Format:	Preprint
Published:	2025
Subjects:	Social and Information Networks Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2503.02513
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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)

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

Equalizing Closeness Centralities via Edge Additions
by: Crane, Alex, et al.
Published: (2025)

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

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

PageRank Centrality in Directed Graphs with Bounded In-Degree
by: Thorup, Mikkel, et al.
Published: (2025)

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

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

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

Pack and Measure: An Effective Approach for Influence Propagation in Social Networks
by: Abu-Khzam, Faisal N., et al.
Published: (2023)

Revisiting Local Computation of PageRank: Simple and Optimal
by: Wang, Hanzhi, et al.
Published: (2024)

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

Accurate and Fast Estimation of Temporal Motifs using Path Sampling
by: Pan, Yunjie, et al.
Published: (2024)

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

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

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

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

The Vertex-Attribute-Constrained Densest $k$-Subgraph Problem
by: Lu, Qiheng, et al.
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)

A Spanning-Tree-Based Algorithm for Planar Graph Dismantling
by: You, Fangchen
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)

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

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

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)

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

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)

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