International audienceWe show, assuming the Strong Exponential Time Hypothesis, that for every ε > 0, approximating directed Diameter on m-arc graphs within ratio 7/4 − ε requires m 4/3−o(1) time. Our construction uses non-negative edge weights but even holds for sparse digraphs, i.e., for which the number of vertices n and the number of arcs m satisfy m =Õ(n). This is the first result that conditionally rules out a near-linear time 5/3-approximation for a variant of Diameter
This paper is devoted to the fast and exact diameter computation in graphs with n vertices and m edg...
The diameter, radius and eccentricities are natural graph parameters. While these problems have been...
A well-known problem for which it is difficult to improve the textbook algorithm is computing the gr...
International audienceWe show, assuming the Strong Exponential Time Hypothesis, that for every ε > 0...
International audienceWe show, assuming the Strong Exponential Time Hypothesis, that for every ε > 0...
Computing the diameter of a graph, i.e. the largest distance, is a fundamental problem that is centr...
Full version of an IPEC'22 paperAn extremity is a vertex such that the removal of its closed neighbo...
The diameter is a fundamental graph parameter and its computation is necessary in many applications....
We show that the eccentricity of every vertex in an undirected graph on n vertices can be computed i...
Presented as part of the Workshop on Algorithms and Randomness on May 16, 2018 at 10:15 a.m. in the ...
International audienceWe provide new bounds for the approximation of extremal distances (the diamete...
© Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, and Nicole Wein; lic...
On sparse graphs, Roditty and Williams [2013] proved that no O(n^{2-?})-time algorithm achieves an a...
We provide new bounds for the approximation of extremal distances (the diameter, the radius, and the...
AbstractDetermining the diameter of a graph is a fundamental graph operation, yet no efficient (i.e....
This paper is devoted to the fast and exact diameter computation in graphs with n vertices and m edg...
The diameter, radius and eccentricities are natural graph parameters. While these problems have been...
A well-known problem for which it is difficult to improve the textbook algorithm is computing the gr...
International audienceWe show, assuming the Strong Exponential Time Hypothesis, that for every ε > 0...
International audienceWe show, assuming the Strong Exponential Time Hypothesis, that for every ε > 0...
Computing the diameter of a graph, i.e. the largest distance, is a fundamental problem that is centr...
Full version of an IPEC'22 paperAn extremity is a vertex such that the removal of its closed neighbo...
The diameter is a fundamental graph parameter and its computation is necessary in many applications....
We show that the eccentricity of every vertex in an undirected graph on n vertices can be computed i...
Presented as part of the Workshop on Algorithms and Randomness on May 16, 2018 at 10:15 a.m. in the ...
International audienceWe provide new bounds for the approximation of extremal distances (the diamete...
© Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, and Nicole Wein; lic...
On sparse graphs, Roditty and Williams [2013] proved that no O(n^{2-?})-time algorithm achieves an a...
We provide new bounds for the approximation of extremal distances (the diameter, the radius, and the...
AbstractDetermining the diameter of a graph is a fundamental graph operation, yet no efficient (i.e....
This paper is devoted to the fast and exact diameter computation in graphs with n vertices and m edg...
The diameter, radius and eccentricities are natural graph parameters. While these problems have been...
A well-known problem for which it is difficult to improve the textbook algorithm is computing the gr...