Next Article in Journal / Special Issue
A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree
Previous Article in Journal / Special Issue
Dubins Traveling Salesman Problem with Neighborhoods: A Graph-Based Approach
Algorithms 2013, 6(1), 100-118; doi:10.3390/a6010100

Computing the Eccentricity Distribution of Large Graphs

*  and
Received: 1 November 2012 / Revised: 24 January 2013 / Accepted: 31 January 2013 / Published: 18 February 2013
(This article belongs to the Special Issue Graph Algorithms)
Download PDF [450 KB, uploaded 18 February 2013]
Abstract: The eccentricity of a node in a graph is defined as the length of a longest shortest path starting at that node. The eccentricity distribution over all nodes is a relevant descriptive property of the graph, and its extreme values allow the derivation of measures such as the radius, diameter, center and periphery of the graph. This paper describes two new methods for computing the eccentricity distribution of large graphs such as social networks, web graphs, biological networks and routing networks.We first propose an exact algorithm based on eccentricity lower and upper bounds, which achieves significant speedups compared to the straightforward algorithm when computing both the extreme values of the distribution as well as the eccentricity distribution as a whole. The second algorithm that we describe is a hybrid strategy that combines the exact approach with an efficient sampling technique in order to obtain an even larger speedup on the computation of the entire eccentricity distribution. We perform an extensive set of experiments on a number of large graphs in order to measure and compare the performance of our algorithms, and demonstrate how we can efficiently compute the eccentricity distribution of various large real-world graphs.
Keywords: graphs; eccentricity; diameter; radius; periphery; center graphs; eccentricity; diameter; radius; periphery; center
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Export to BibTeX |

MDPI and ACS Style

Takes, F.W.; Kosters, W.A. Computing the Eccentricity Distribution of Large Graphs. Algorithms 2013, 6, 100-118.

AMA Style

Takes FW, Kosters WA. Computing the Eccentricity Distribution of Large Graphs. Algorithms. 2013; 6(1):100-118.

Chicago/Turabian Style

Takes, Frank W.; Kosters, Walter A. 2013. "Computing the Eccentricity Distribution of Large Graphs." Algorithms 6, no. 1: 100-118.

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert