On computing the diameter of real-world undirected graphs
We propose a new algorithm for the classical problem of computing the diameter of
undirected unweighted graphs, namely, the maximum distance among all the pairs of nodes …
undirected unweighted graphs, namely, the maximum distance among all the pairs of nodes …
Hardness of approximate diameter: Now for undirected graphs
Approximating the graph diameter is a basic task of both theoretical and practical interest. A
simple folklore algorithm can output a 2-approximation to the diameter in linear time by …
simple folklore algorithm can output a 2-approximation to the diameter in linear time by …
[HTML][HTML] Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games
In this paper, we propose a new algorithm that computes the radius and the diameter of a
weakly connected digraph G=(V, E), by finding bounds through heuristics and improving …
weakly connected digraph G=(V, E), by finding bounds through heuristics and improving …
Tight conditional lower bounds for approximating diameter in directed graphs
M Dalirrooyfard, N Wein - Proceedings of the 53rd Annual ACM SIGACT …, 2021 - dl.acm.org
Among the most fundamental graph parameters is the Diameter, the largest distance
between any pair of vertices in a graph. Computing the Diameter of a graph with m edges …
between any pair of vertices in a graph. Computing the Diameter of a graph with m edges …
Diameter minimization by shortcutting with degree constraints
F Adriaens, A Gionis - 2022 IEEE International Conference on …, 2022 - ieeexplore.ieee.org
We consider the problem of adding a fixed number of new edges to an undirected graph in
order to minimize the diameter of the augmented graph, and under the constraint that the …
order to minimize the diameter of the augmented graph, and under the constraint that the …
An evaluation of parallel eccentricity estimation algorithms on undirected real-world graphs
J Shun - Proceedings of the 21th ACM SIGKDD International …, 2015 - dl.acm.org
This paper presents efficient shared-memory parallel implementations and the first
comprehensive experimental study of graph eccentricity estimation algorithms in the …
comprehensive experimental study of graph eccentricity estimation algorithms in the …
On computing the diameter of (weighted) link streams
M Calamai, P Crescenzi, A Marino - … International Symposium on …, 2021 - drops.dagstuhl.de
A weighted link stream is a pair (V, 𝔼) comprising V, the set of nodes, and 𝔼, the list of
temporal edges (u, v, t, λ), where u, v are two nodes in V, t is the starting time of the temporal …
temporal edges (u, v, t, λ), where u, v are two nodes in V, t is the starting time of the temporal …
Analysis and enumeration
A Marino - Algorithms for biological graphs. This pricewinning …, 2015 - Springer
The aim of enumeration is listing all the feasible solutions of a given problem: this is
particularly useful whenever the goal of the problem is not clear and we need to check all its …
particularly useful whenever the goal of the problem is not clear and we need to check all its …
SILVAN: Estimating Betweenness Centralities with Progressive Sampling and Non-uniform Rademacher Bounds
L Pellegrina, F Vandin - … Transactions on Knowledge Discovery from Data, 2023 - dl.acm.org
“Sim Sala Bim!”—Silvan, https://en. wikipedia. org/wiki/Silvan_ (illusionist) Betweenness
centrality is a popular centrality measure with applications in several domains and whose …
centrality is a popular centrality measure with applications in several domains and whose …
On computing the diameter of (weighted) link streams
M Calamai, P Crescenzi, A Marino - ACM Journal of Experimental …, 2022 - dl.acm.org
A weighted link stream is a pair (V, 𝔼) comprising V, the set of nodes, and 𝔼, the list of
temporal edges (u, v, t, λ), where u, v are two nodes in V, t is the starting time of the temporal …
temporal edges (u, v, t, λ), where u, v are two nodes in V, t is the starting time of the temporal …