OPEX: Optimized Eccentricity Computation in Graphs
- Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
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).
- Research Organization:
- Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 1113361
- Report Number(s):
- LLNL-TR-513942
- Country of Publication:
- United States
- Language:
- English
Similar Records
Scalable Pattern Matching in Metadata Graphs via Constraint Checking
A generative graph model for electrical infrastructure networks