TRIM: An Efficient Framework for Exact Eccentricity Computation on Large-Scale Graphs
Summary: TRIM: exact eccentricity computation using vertex-dominance to prune redundant vertices and a new skip-with-termination rule that fixes non-termination in prior bounding-based BFS methods. Adds traversal-merging to cut BFSs, achieving up to 100× speedup and scalability to 100M-node graphs. (summarized by gpt-5-mini on Mar 13 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Dian Ouyang
- 2. Jiajie Lin
- 3. Wentao Li
- 4. Fan Zhang
- 5. Jianye Yang
- 6. Xi Luo
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,035 | Scaling Up Distance Labeling on Graphs with Core-Periphery Properties | 2020 | SIGMOD | 5.7470184e-05 |
| 9,952 | On Scalable Computation of Graph Eccentricities | 2022 | SIGMOD | 4.2405999e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,630 | A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition | 2022 | VLDB | 4.480887e-05 |
| 9,091 | Efficiently Enumerating Minimal Triangulations | 2017 | PODS | 4.39823e-05 |
| 589 | Massive Graph Triangulation | 2013 | SIGMOD | 0.00019576567 |
| 9,390 | Efficient Maximum s-Bundle Search via Local Vertex Connectivity | 2025 | SIGMOD | 4.3441378e-05 |
| 10,124 | TRIM: Accelerating High-Dimensional Vector Similarity Search with Enhanced Triangle-Inequality-Based Pruning | 2026 | SIGMOD | 4.1945683e-05 |
| 4,984 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD | 5.7867286e-05 |
| 7,346 | I/O Efficient ECC Graph Decomposition via Graph Reduction | 2016 | VLDB | 4.7556749e-05 |
| 6,207 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD | 5.1572428e-05 |
| 7,320 | Accelerating Maximal Clique Enumeration via Graph Reduction | 2024 | VLDB | 4.7629325e-05 |
| 9,952 | On Scalable Computation of Graph Eccentricities | 2022 | SIGMOD | 4.2405999e-05 |