Clique partitions, graph compression and speeding-up algorithms
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
On the all-pairs-shortest-path problem
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Fast estimation of diameter and shortest paths (without matrix multiplication)
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Diameter determination on restricted graph families
Discrete Applied Mathematics
Testing the diameter of graphs
Random Structures & Algorithms
LexBFS-Orderings and Power of Graphs
WG '96 Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science
A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Graphs over time: densification laws, shrinking diameters and possible explanations
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
All-pairs shortest paths for unweighted undirected graphs in o(mn) time
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Estimating all pairs shortest paths in restricted graph families: a unified approach
Journal of Algorithms
Witnesses for Boolean matrix multiplication and for shortest paths
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Finding the diameter in real-world graphs experimentally turning a lower bound into an upper bound
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Determining the diameter of small world networks
Proceedings of the 20th ACM international conference on Information and knowledge management
Fault tolerance logical network properties of irregular graphs
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
I/O-efficient hierarchical diameter approximation
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Ligra: a lightweight graph processing framework for shared memory
Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming
Fast exact shortest-path distance queries on large networks by pruned landmark labeling
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
On computing the diameter of real-world undirected graphs
Theoretical Computer Science
Hi-index | 0.01 |
The diameter of a graph is among its most basic parameters. Since a few years ago, it moreover became a key issue to compute it for massive graphs in the context of complex network analysis. However, known algorithms, including the ones producing approximate values, have too high a time and/or space complexity to be used in such cases. We propose here a new approach relying on very simple and fast algorithms that compute (upper and lower) bounds for the diameter. We show empirically that, on various real-world cases representative of complex networks studied in the literature, the obtained bounds are very tight (and even equal in some cases). This leads to rigorous and very accurate estimations of the actual diameter in cases which were previously untractable in practice.