OPEX: Optimized Eccentricity Computation in Graphs
Abstract
Real-world graphs have many properties of interest, but often these properties are expensive to compute. We focus on eccentricity, radius and diameter in this work. These properties are useful measures of the global connectivity patterns in a graph. Unfortunately, computing eccentricity for all nodes is O(n2) for a graph with n nodes. We present OPEX, a novel combination of optimizations which improves computation time of these properties by orders of magnitude in real-world experiments on graphs of many different sizes. We run OPEX on graphs with up to millions of links. OPEX gives either exact results or bounded approximations, unlike its competitors which give probabilistic approximations or sacrifice node-level information (eccentricity) to compute graphlevel information (diameter).
- Authors:
-
- Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
- Publication Date:
- Research Org.:
- Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
- Sponsoring Org.:
- USDOE
- OSTI Identifier:
- 1113361
- Report Number(s):
- LLNL-TR-513942
- DOE Contract Number:
- W-7405-ENG-48
- Resource Type:
- Technical Report
- Country of Publication:
- United States
- Language:
- English
- Subject:
- 97 MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; graph algorithms
Citation Formats
Henderson, Keith. OPEX: Optimized Eccentricity Computation in Graphs. United States: N. p., 2011.
Web. doi:10.2172/1113361.
Henderson, Keith. OPEX: Optimized Eccentricity Computation in Graphs. United States. https://doi.org/10.2172/1113361
Henderson, Keith. 2011.
"OPEX: Optimized Eccentricity Computation in Graphs". United States. https://doi.org/10.2172/1113361. https://www.osti.gov/servlets/purl/1113361.
@article{osti_1113361,
title = {OPEX: Optimized Eccentricity Computation in Graphs},
author = {Henderson, Keith},
abstractNote = {Real-world graphs have many properties of interest, but often these properties are expensive to compute. We focus on eccentricity, radius and diameter in this work. These properties are useful measures of the global connectivity patterns in a graph. Unfortunately, computing eccentricity for all nodes is O(n2) for a graph with n nodes. We present OPEX, a novel combination of optimizations which improves computation time of these properties by orders of magnitude in real-world experiments on graphs of many different sizes. We run OPEX on graphs with up to millions of links. OPEX gives either exact results or bounded approximations, unlike its competitors which give probabilistic approximations or sacrifice node-level information (eccentricity) to compute graphlevel information (diameter).},
doi = {10.2172/1113361},
url = {https://www.osti.gov/biblio/1113361},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Mon Nov 14 00:00:00 EST 2011},
month = {Mon Nov 14 00:00:00 EST 2011}
}