Saved in:
| Main Authors: | Mahapatra, Gautam, Pradhan, Priodyuti, Khan, Abhinandan, Setua, Sanjit Kumar, Pal, Rajat Kumar, Rathor, Ayush |
|---|---|
| Format: | Preprint |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2007.05637 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Fast Approximate CoSimRanks via Random Projections
by: Yang, Renchi, et al.
Published: (2020)
by: Yang, Renchi, et al.
Published: (2020)
Graph Discovery and Source Detection in Temporal Graphs
by: Bals, Ben
Published: (2025)
by: Bals, Ben
Published: (2025)
Overcoming Non-Submodularity: Towards Constant Approximation for Network Immunization
by: Srivastava, Ajitesh, et al.
Published: (2024)
by: Srivastava, Ajitesh, et al.
Published: (2024)
ProbeWalk: Fast Estimation of Biharmonic Distance on Graphs via Probe-Driven Random Walks
by: Zheng, Dehong, et al.
Published: (2025)
by: Zheng, Dehong, et al.
Published: (2025)
Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
by: Chen, Jingbang, et al.
Published: (2024)
by: Chen, Jingbang, et al.
Published: (2024)
An Edge-Based Decomposition Framework for Temporal Networks
by: Oettershagen, Lutz, et al.
Published: (2023)
by: Oettershagen, Lutz, et al.
Published: (2023)
Finding coherent node groups in directed graphs
by: Kumpulainen, Iiro, et al.
Published: (2023)
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)
by: Nakamura, Kengo, et al.
Published: (2026)
Counting Balanced Triangles on Social Networks With Uncertain Edge Signs
by: Zhou, Alexander, et al.
Published: (2026)
by: Zhou, Alexander, et al.
Published: (2026)
Profit Maximization in Closed Social Networks
by: Sharma, Poonam, et al.
Published: (2026)
by: Sharma, Poonam, et al.
Published: (2026)
Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance
by: Chang, Lijun
Published: (2024)
by: Chang, Lijun
Published: (2024)
Inferring Tie Strength in Temporal Networks
by: Oettershagen, Lutz, et al.
Published: (2022)
by: Oettershagen, Lutz, et al.
Published: (2022)
Temporal Betweenness Centrality on Shortest Walks Variants
by: Naima, Mehdi
Published: (2023)
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)
by: Brandt-Tumescheit, Fabian, et al.
Published: (2024)
Fast Percolation Centrality Approximation with Importance Sampling
by: Cruciani, Antonio, et al.
Published: (2025)
by: Cruciani, Antonio, et al.
Published: (2025)
The Vertex-Attribute-Constrained Densest $k$-Subgraph Problem
by: Lu, Qiheng, et al.
Published: (2025)
by: Lu, Qiheng, et al.
Published: (2025)
Catch Me If You Can: Finding the Source of Infections in Temporal Networks
by: Bals, Ben, et al.
Published: (2024)
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)
by: Bläsius, Thomas, et al.
Published: (2022)
Fast Estimation of Percolation Centrality
by: Cruciani, Antonio
Published: (2024)
by: Cruciani, Antonio
Published: (2024)
Equalizing Closeness Centralities via Edge Additions
by: Crane, Alex, et al.
Published: (2025)
by: Crane, Alex, et al.
Published: (2025)
An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale
by: Spaeh, Fabian, et al.
Published: (2025)
by: Spaeh, Fabian, et al.
Published: (2025)
Efficient Sampling of Temporal Networks with Preserved Causality Structure
by: Stamm, Felix I., et al.
Published: (2025)
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)
by: Bishnu, Arijit, et al.
Published: (2025)
Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation
by: Bläsius, Thomas, et al.
Published: (2024)
by: Bläsius, Thomas, et al.
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)
by: Lu, Qiheng, et al.
Published: (2024)
A Spanning-Tree-Based Algorithm for Planar Graph Dismantling
by: You, Fangchen
Published: (2025)
by: You, Fangchen
Published: (2025)
Opinion Maximization in Social Networks by Modifying Internal Opinions
by: Wang, Gengyu, et al.
Published: (2025)
by: Wang, Gengyu, et al.
Published: (2025)
Locally Differentially Private Graph Clustering via the Power Iteration Method
by: Suppakitpaisarn, Vorapong, et al.
Published: (2025)
by: Suppakitpaisarn, Vorapong, et al.
Published: (2025)
On the accurate computation of expected modularity in probabilistic networks
by: Shen, Xin, et al.
Published: (2024)
by: Shen, Xin, et al.
Published: (2024)
Mixing Time Matters: Accelerating Effective Resistance Estimation via Bidirectional Method
by: Cui, Guanyu, et al.
Published: (2025)
by: Cui, Guanyu, et al.
Published: (2025)
Optimizing Probabilistic Propagation in Graphs by Adding Edges
by: Bhaskara, Aditya, et al.
Published: (2024)
by: Bhaskara, Aditya, et al.
Published: (2024)
MANTRA: Temporal Betweenness Centrality Approximation through Sampling
by: Cruciani, Antonio
Published: (2023)
by: Cruciani, Antonio
Published: (2023)
A novel DFS/BFS approach towards link prediction
by: Dörpinghaus, Jens, et al.
Published: (2024)
by: Dörpinghaus, Jens, et al.
Published: (2024)
Efficient and Adaptive Estimation of Local Triadic Coefficients
by: Sarpe, Ilie, et al.
Published: (2025)
by: Sarpe, Ilie, et al.
Published: (2025)
An Improved Combinatorial Algorithm for Edge-Colored Clustering in Hypergraphs
by: Han, Seongjune, et al.
Published: (2026)
by: Han, Seongjune, et al.
Published: (2026)
Beyond Uniform Reverse Sampling: A Hybrid Sampling Technique for Misinformation Prevention
by: Tong, Gunagmo, et al.
Published: (2019)
by: Tong, Gunagmo, et al.
Published: (2019)
Enabling Asymptotic Truth Learning in a Social Network
by: Lu, Kevin, et al.
Published: (2024)
by: Lu, Kevin, et al.
Published: (2024)
On the Complexity of Community-aware Network Sparsification
by: Herrendorf, Emanuel, et al.
Published: (2024)
by: Herrendorf, Emanuel, et al.
Published: (2024)
Consistent Tie-Strength Labeling for Multilayer Strong Triadic Closure
by: Oettershagen, Lutz, et al.
Published: (2024)
by: Oettershagen, Lutz, et al.
Published: (2024)
Local Centrality Minimization with Quality Guarantees
by: Miyauchi, Atsushi, et al.
Published: (2024)
by: Miyauchi, Atsushi, et al.
Published: (2024)
Similar Items
-
Fast Approximate CoSimRanks via Random Projections
by: Yang, Renchi, et al.
Published: (2020) -
Graph Discovery and Source Detection in Temporal Graphs
by: Bals, Ben
Published: (2025) -
Overcoming Non-Submodularity: Towards Constant Approximation for Network Immunization
by: Srivastava, Ajitesh, et al.
Published: (2024) -
ProbeWalk: Fast Estimation of Biharmonic Distance on Graphs via Probe-Driven Random Walks
by: Zheng, Dehong, et al.
Published: (2025) -
Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
by: Chen, Jingbang, et al.
Published: (2024)