Image de couverture de livre

A novel DFS/BFS approach towards link prediction

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Dörpinghaus, Jens, Hübenthal, Tobias, Stepanov, Denis
Format:	Preprint
Publié:	2024
Sujets:	Social and Information Networks Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the power of standard DFS and BFS
par: Bui-Xuan, Binh-Minh, et autres
Publié: (2026)

Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation
par: Bläsius, Thomas, et autres
Publié: (2024)

A Spanning-Tree-Based Algorithm for Planar Graph Dismantling
par: You, Fangchen
Publié: (2025)

A Fully-dynamic Approximation Algorithm for Maximum Weight b-Matchings in Graphs
par: Brandt-Tumescheit, Fabian, et autres
Publié: (2024)

Beyond Uniform Reverse Sampling: A Hybrid Sampling Technique for Misinformation Prevention
par: Tong, Gunagmo, et autres
Publié: (2019)

Overcoming Non-Submodularity: Towards Constant Approximation for Network Immunization
par: Srivastava, Ajitesh, et autres
Publié: (2024)

Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
par: Chen, Jingbang, et autres
Publié: (2024)

Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance
par: Chang, Lijun
Publié: (2024)

Catch Me If You Can: Finding the Source of Infections in Temporal Networks
par: Bals, Ben, et autres
Publié: (2024)

Fast Estimation of Percolation Centrality
par: Cruciani, Antonio
Publié: (2024)

On Densest $k$-Subgraph Mining and Diagonal Loading: Optimization Landscape and Finite-Step Exact Convergence Analysis
par: Lu, Qiheng, et autres
Publié: (2024)

On the accurate computation of expected modularity in probabilistic networks
par: Shen, Xin, et autres
Publié: (2024)

Optimizing Probabilistic Propagation in Graphs by Adding Edges
par: Bhaskara, Aditya, et autres
Publié: (2024)

Enabling Asymptotic Truth Learning in a Social Network
par: Lu, Kevin, et autres
Publié: (2024)

On the Complexity of Community-aware Network Sparsification
par: Herrendorf, Emanuel, et autres
Publié: (2024)

Consistent Tie-Strength Labeling for Multilayer Strong Triadic Closure
par: Oettershagen, Lutz, et autres
Publié: (2024)

Local Centrality Minimization with Quality Guarantees
par: Miyauchi, Atsushi, et autres
Publié: (2024)

Influence Maximization in Hypergraphs by Stratified Sampling for Efficient Generation of Reverse Reachable Sets
par: Zhang, Lingling, et autres
Publié: (2024)

Scalable Temporal Motif Densest Subnetwork Discovery
par: Sarpe, Ilie, et autres
Publié: (2024)

Graph Discovery and Source Detection in Temporal Graphs
par: Bals, Ben
Publié: (2025)

ProbeWalk: Fast Estimation of Biharmonic Distance on Graphs via Probe-Driven Random Walks
par: Zheng, Dehong, et autres
Publié: (2025)

Multilevel Digital Contact Tracing
par: Mahapatra, Gautam, et autres
Publié: (2020)

An Edge-Based Decomposition Framework for Temporal Networks
par: Oettershagen, Lutz, et autres
Publié: (2023)

Finding coherent node groups in directed graphs
par: Kumpulainen, Iiro, et autres
Publié: (2023)

Linear-Time Exact Computation of Influence Spread on Bounded-Pathwidth Graphs
par: Nakamura, Kengo, et autres
Publié: (2026)

Counting Balanced Triangles on Social Networks With Uncertain Edge Signs
par: Zhou, Alexander, et autres
Publié: (2026)

Profit Maximization in Closed Social Networks
par: Sharma, Poonam, et autres
Publié: (2026)

Inferring Tie Strength in Temporal Networks
par: Oettershagen, Lutz, et autres
Publié: (2022)

Fast Approximate CoSimRanks via Random Projections
par: Yang, Renchi, et autres
Publié: (2020)

Temporal Betweenness Centrality on Shortest Walks Variants
par: Naima, Mehdi
Publié: (2023)

Fast Percolation Centrality Approximation with Importance Sampling
par: Cruciani, Antonio, et autres
Publié: (2025)

The Vertex-Attribute-Constrained Densest $k$-Subgraph Problem
par: Lu, Qiheng, et autres
Publié: (2025)

On the External Validity of Average-Case Analyses of Graph Algorithms
par: Bläsius, Thomas, et autres
Publié: (2022)

Equalizing Closeness Centralities via Edge Additions
par: Crane, Alex, et autres
Publié: (2025)

An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale
par: Spaeh, Fabian, et autres
Publié: (2025)

Efficient Sampling of Temporal Networks with Preserved Causality Structure
par: Stamm, Felix I., et autres
Publié: (2025)

Towards Tight Bounds for Estimating Degree Distribution in Streaming and Query Models
par: Bishnu, Arijit, et autres
Publié: (2025)

Opinion Maximization in Social Networks by Modifying Internal Opinions
par: Wang, Gengyu, et autres
Publié: (2025)

Locally Differentially Private Graph Clustering via the Power Iteration Method
par: Suppakitpaisarn, Vorapong, et autres
Publié: (2025)

Mixing Time Matters: Accelerating Effective Resistance Estimation via Bidirectional Method
par: Cui, Guanyu, et autres
Publié: (2025)