No article text was recorded for this version.
all-pairs shortest path bottleneck
Version 2 of 2186 papers200 conceptsfrozen 2026-10-04
Papers in this version
- Blog: A novel method based on node correlation to evaluate the important nodes in complex networks
- Blog: A Divide-and-Conquer Algorithm for Betweenness Centrality
- Blog: Stability and Continuity of Centrality Measures in Weighted Graphs
- Blog: A Survey on Centrality Metrics and Their Implications in Network Resilience
- Blog: Graph Spectral Embedding using the Geodesic Betweenness Centrality
- Blog: A Graph-Based Machine Learning Approach for Bot Detection
- Blog: Graph Energies of Egocentric Networks and Their Correlation with Vertex Centrality Measures
- Blog: Robustness of Complex Networks against Attacks Guided by Damage
- Blog: Perturbation-based Graph Active Learning for Weakly-Supervised Belief Representation Learning
- Blog: A parameterised model for link prediction using node centrality and similarity measure based on graph embedding
- Blog: Recurrent Distance Filtering for Graph Representation Learning
- Blog: Proxying Betweenness Centrality Rankings in Temporal Networks
- Blog: Ranking differential Hubs in gene Co-Expression Networks
- Blog: Centralite du second ordre : Calcul distribue de l'importance de noeuds
- Blog: Towards Improving Brandes' Algorithm for Betweenness Centrality
- Blog: Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees
- Blog: Towards Scalable Network Delay Minimization
- Blog: Range-limited Centrality Measures in Complex Networks
- Blog: A Fast Algorithm for Moderating Critical Nodes via Edge Removal
- Blog: SaPHyRa: A Learning Theory Approach to Ranking Nodes in Large Networks
- Blog: Approximating Network Centrality Measures Using Node Embedding and Machine Learning
- Blog: Identifying Influential Links for Event Propagation on Twitter: A Network of Networks Approach
- Blog: Identifying key nodes in complex networks based on an improved gravity model
- Blog: Toward a Distance Oracle for Billion-Node Graphs
- Blog: Density-Preserving Heterogeneous Graph Sparsification for Representation Learning
- Blog: Beyond non-backtracking: non-cycling network centrality measures
- Blog: ABRA: Approximating Betweenness Centrality in Static and Dynamic Graphs with Rademacher Averages
- Blog: An Activation Force-based Affinity Measure for Analyzing Complex Networks
- Blog: Rethinking Node-wise Propagation for Large-scale Graph Learning
- Blog: Probabilistic Community Discovery Using Hierarchical Latent Gaussian Mixture Model
- Blog: CenGCN: Centralized Convolutional Networks with Vertex Imbalance for Scale-Free Graphs
- Blog: Control of Epidemic Process via Link Removal: Flattening the Infection Curve by Social Distancing
- Blog: Metrics in the Space of High Order Networks
- Blog: Efficient Computation of Semivalues for Game-Theoretic Network Centrality
- Blog: Assessing Graph Robustness through Modified Zagreb Index
- Blog: Pre-Training Graph Neural Networks for Generic Structural Feature Extraction
- Blog: Reducing Access Disparities in Networks using Edge Augmentation✱
- Blog: Fast direction-aware proximity for graph mining
- Blog: Entropy and Graph Energy of Complex Networks
- Blog: Decentralized dynamic understanding of hidden relations in complex networks
- Blog: Functional characterization and topological modularity of molecular interaction networks
- Blog: Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases
- Blog: KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
- Blog: PANDA: Expanded Width-Aware Message Passing Beyond Rewiring
- Blog: Graph centrality is a question of scale
- Blog: Metropolis-Hastings Algorithms for Estimating Betweenness Centrality
- Blog: SAKE: Estimating Katz Centrality Based on Sampling for Large-Scale Social Networks
- Blog: Discovering Top-k Structural Hole Spanners in Dynamic Networks
- Blog: Scaling Expected Force: Efficient Identification of Key Nodes in Network-based Epidemic Models
- Blog: NS-DBSCAN: A Density-Based Clustering Algorithm in Network Space
- Blog: A GPU-Based Solution to Fast Calculation of Betweenness Centrality on Large Weighted Networks
- Blog: Efficient Parallel Genetic Algorithm for Perturbed Substructure Optimization in Complex Network
- Blog: A scalable distributed dynamical systems approach to compute the strongly connected components and diameter of networks
- Blog: Unsupervised Graph-basedWord Sense Disambiguation Using Measures of Word Semantic Similarity
- Blog: From random walks to distances on unweighted graphs
- Blog: Kanopy: Analysing the Semantic Network around Document Topics
- Blog: Identifying high betweenness centrality nodes in large social networks
- Blog: Current Flow Group Closeness Centrality for Complex Networks?
- Blog: Learning to Identify High Betweenness Centrality Nodes from Scratch: A Novel Graph Neural Network Approach
- Blog: Contextual centrality: going beyond network structure
Showing 60 of 186 papers.
History & citation
Current · Permanent link
- localized centrality estimation split from this direction (53% overlap)
- scalable centrality approximation split from this direction (55% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_all_pairs_shortest_path_bottleneck_3e793214,
title = {all-pairs shortest path bottleneck},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/all-pairs-shortest-path-bottleneck/rdr_3e79321468a94658afe3ac0ea37ecc56},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 2, frozen text):
@misc{lacuna_all_pairs_shortest_path_bottleneck_3e793214_v2,
title = {all-pairs shortest path bottleneck},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/all-pairs-shortest-path-bottleneck/rdr_3e79321468a94658afe3ac0ea37ecc56/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-19},
}