Back to papers
Distributed Edge Partitioning for Trillion-edge Graphs
Summary: Distributed NE is a parallel graph partitioner for trillion-edge graphs, using a parallel expansion to grow partitions from seeds while minimizing local vertex cuts. The method enjoys a theoretical upper bound on quality and outperforms state-of-the-art distributed partitioners.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 11959
- Venue
- VLDB
- Year
- 2019
- Pagerank
- 6.3355073e-05
- Overall Rank
- 4,234 | 70.55%
- DOI
-
10.14778/3358701.3358706
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 11 of 11 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 8,254 |
A Study of Partitioning Policies for Graph Analytics on Large-scale Distributed Platforms |
2019 |
VLDB |
4.5491792e-05 |
| 1,953 |
Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows |
2018 |
VLDB |
9.9665955e-05 |
| 6,146 |
Distributed Graph Simulation: Impossibility and Possibility |
2014 |
VLDB |
5.1857597e-05 |
| 4,867 |
Application Driven Graph Partitioning |
2020 |
SIGMOD |
5.8651797e-05 |
| 1,968 |
An Experimental Comparison of Partitioning Strategies in Distributed Graph Processing |
2017 |
VLDB |
9.9071968e-05 |
| 1,976 |
Towards Effective Partition Management for Large Graphs |
2012 |
SIGMOD |
9.8844201e-05 |
| 4,895 |
Social Hash Partitioner: A Scalable Distributed Hypergraph Partitioner |
2017 |
VLDB |
5.8476644e-05 |
| 3,573 |
A Scalable Distributed Graph Partitioner |
2015 |
VLDB |
6.954939e-05 |
| 4,497 |
Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent |
2019 |
VLDB |
6.1387773e-05 |
| 5,949 |
Hybrid Edge Partitioner: Partitioning Large Power-Law Graphs under Memory Constraints |
2021 |
SIGMOD |
5.2595857e-05 |