Graphs & digraphs (2nd ed.)
Matrix multiplication via arithmetic progressions
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Introduction to algorithms
On the all-pairs-shortest-path problem
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
An experimental comparison of three graph drawing algorithms (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
SIAM Journal on Computing
LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
Discrete Applied Mathematics
Dominating Cliques in Distance-Hereditary Graphs
SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings
WG '94 Proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science
LexBFS-Orderings and Power of Graphs
WG '96 Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science
Algorithms in c, part 5: graph algorithms, third edition
Algorithms in c, part 5: graph algorithms, third edition
On Trade-Offs in External-Memory Diameter-Approximation
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Faster approximation of distances in graphs
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
I/O-efficient hierarchical diameter approximation
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Fast approximation algorithms for the diameter and radius of sparse graphs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Approximating the diameter of planar graphs in near linear time
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Fast approximation of betweenness centrality through sampling
Proceedings of the 7th ACM international conference on Web search and data mining
| Hi-index | 0.00 |
The increasing amount of data to be processed by computers has led to the need for highly efficient algorithms for various computational problems. Moreover, the algorithms should be as simple as possible to be practically applicable. In this paper we propose a very simple approximation algorithm for finding the diameter and the radius of an undirected graph. The algorithm runs in $O(m\sqrt{n})$ time and gives an additive error of $O(\sqrt{n})$ for a graph with n vertices and m edges. Practical experiments show that the results of our algorithm are close to the optimum and compare favorably to the 2/3-approximation algorithm for the diameter problem by Aingworth et al [1].