On the public citation graph
Partitioning Trillion-Edge Graphs in Minutes
0 signed · 98 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/spe.587openalex-snapshot
UbiCrawler: a scalable fully distributed Web crawler
inferredcites →https://doi.org/10.1006/jpdc.1997.1403openalex-snapshot
A Parallel Algorithm for Multilevel Graph Partitioning and Sparse Matrix Ordering
inferredcites →https://doi.org/10.1007/978-1-4614-6170-8_23openalex-snapshot
Benchmarking for Graph Clustering and Partitioning
inferredcites →https://doi.org/10.1007/978-3-319-49487-6_4openalex-snapshot
Recent Advances in Graph Partitioning
inferredcites →https://doi.org/10.1007/978-94-011-5412-3_12openalex-snapshot
Graph Partitioning Algorithms with Applications to Scientific Computing
inferredcites →https://doi.org/10.1007/s10115-013-0693-zopenalex-snapshot
Defining and evaluating network communities based on ground-truth
inferredcites →https://doi.org/10.1038/30918openalex-snapshot
Collective dynamics of ‘small-world’ networks
inferredcites →https://doi.org/10.1080/15427951.2009.10129177openalex-snapshot
Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
inferredcites →https://doi.org/10.1103/physreve.76.036106openalex-snapshot
Near linear time algorithm to detect community structures in large-scale networks
inferredcites →https://doi.org/10.1109/bigdata.2014.7004265openalex-snapshot
PuLP: Scalable multi-objective multi-constraint partitioning for small-world networks
inferredcites →https://doi.org/10.1109/icde.2014.6816682openalex-snapshot
How to partition a billion-node graph
inferredcites →https://doi.org/10.1109/ipdps.2014.52openalex-snapshot
Traversing Trillions of Edges in Real Time: Graph Exploration on Large-Scale Parallel Machines
inferredcites →https://doi.org/10.1109/ipdps.2015.18openalex-snapshot
Parallel Graph Partitioning for Complex Networks
inferredcites →https://doi.org/10.1109/ipdps.2016.93openalex-snapshot
A Case Study of Complex Graph Analysis in Distributed Memory: Implementation and Optimization
inferredcites →https://doi.org/10.1126/science.286.5439.509openalex-snapshot
Emergence of Scaling in Random Networks
inferredcites →https://doi.org/10.1137/1.9781611972740.43openalex-snapshot
R-MAT: A Recursive Model for Graph Mining
inferredcites →https://doi.org/10.1137/15m1026183openalex-snapshot
Complex Network Partitioning Using Label Propagation
inferredcites →https://doi.org/10.1137/s1064827595287997openalex-snapshot
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
inferredcites →https://doi.org/10.1145/1089014.1089021openalex-snapshot
An overview of the Trilinos project
inferredcites →https://doi.org/10.1145/2049662.2049663openalex-snapshot
The university of Florida sparse matrix collection
inferredcites →https://doi.org/10.1145/2063384.2063469openalex-snapshot
A scalable eigensolver for large scale-free graphs using 2D graph partitioning
inferredcites →https://doi.org/10.1145/2433396.2433461openalex-snapshot
Balanced label propagation for partitioning massive graphs
inferredcites →https://doi.org/10.1145/2503210.2503293openalex-snapshot
Scalable matrix computations on large scale-free graphs using 2D graph partitioning
inferredcites →https://doi.org/10.1145/316194.316229openalex-snapshot
On power-law relationships of the Internet topology
inferredcites →https://doi.org/10.1609/icwsm.v4i1.14033openalex-snapshot
Measuring User Influence in Twitter: The Million Follower Fallacy
inferredcites →https://doi.org/10.2307/2007640openalex-snapshot
Computer Solution of Large Sparse Positive Definite Systems.
inferredcites →https://doi.org/10.48550/arxiv.1309.1049openalex-snapshot
xDGP: A Dynamic Graph Processing System with Adaptive Partitioning
inferredcites →https://doi.org/10.48550/arxiv.1311.3144openalex-snapshot
Recent Advances in Graph Partitioning
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-01461-2_1openalex-snapshot
Think Sequential, Run Parallel
inferred← citeshttps://doi.org/10.1007/978-3-030-85665-6_11openalex-snapshot
An MPI-based Algorithm for Mapping Complex Networks onto Hierarchical Architectures
inferred← citeshttps://doi.org/10.1007/978-3-319-63962-8_312-2openalex-snapshot
Graph Partitioning: Formulations and Applications to Big Data
inferred← citeshttps://doi.org/10.1007/978-3-319-77525-8_312openalex-snapshot
Graph Partitioning: Formulations and Applications to Big Data
inferred← citeshttps://doi.org/10.1007/978-3-319-96983-1_47openalex-snapshot
High-Quality Shared-Memory Graph Partitioning
inferred← citeshttps://doi.org/10.1007/978-981-16-0479-9_2openalex-snapshot
Distributed Graph Processing: Techniques and Systems
inferred← citeshttps://doi.org/10.1007/978-981-19-9297-1_10openalex-snapshot
OLPGP: An Optimized Label Propagation-Based Distributed Graph Partitioning Algorithm
inferred← citeshttps://doi.org/10.1007/978-981-96-2373-0_22openalex-snapshot
NOBGP: A Novel Optimized Balanced Graph Partitioning Algorithm
inferred← citeshttps://doi.org/10.1007/978-981-96-9961-2_31openalex-snapshot
Accelerating Distributed Graph Partitioning Based on Intelligent Network
inferred← citeshttps://doi.org/10.1007/s00778-024-00860-1openalex-snapshot
Minimum motif-cut: a workload-aware RDF graph partitioning strategy
inferred← citeshttps://doi.org/10.1007/s10586-021-03511-0openalex-snapshot
Parallel analysis of Ethereum blockchain transaction data using cluster computing
inferred← citeshttps://doi.org/10.1007/s10619-024-07442-8openalex-snapshot
PECC: parallel expansion based on clustering coefficient for efficient graph partitioning
inferred← citeshttps://doi.org/10.1007/s11227-025-07907-2openalex-snapshot
Distributed framework for high-quality graph partitioning
inferred← citeshttps://doi.org/10.1007/s11280-025-01360-0openalex-snapshot
SemPart: Yet another RDF data partitioning strategy
inferred← citeshttps://doi.org/10.1007/s11390-021-1242-yopenalex-snapshot
FDGLib: A Communication Library for Efficient Large-Scale Graph Processing in FPGA-Accelerated Data Centers
inferred← citeshttps://doi.org/10.1016/j.future.2019.06.033openalex-snapshot
TSH: Easy-to-be distributed partitioning for large-scale graphs
inferred← citeshttps://doi.org/10.1016/j.parco.2021.102769openalex-snapshot
Sphynx: A parallel multi-GPU graph partitioner for distributed-memory systems
inferred← citeshttps://doi.org/10.1016/j.parco.2022.102896openalex-snapshot
Parallel graph coloring algorithms for distributed GPU environments
inferred← citeshttps://doi.org/10.1109/access.2020.2987355openalex-snapshot
Label Propagation-Based Parallel Graph Partitioning for Large-Scale Graph Data
inferred← citeshttps://doi.org/10.1109/access.2020.3014351openalex-snapshot
GAP: Genetic Algorithm Based Large-Scale Graph Partition in Heterogeneous Cluster
inferred← citeshttps://doi.org/10.1109/access.2022.3219422openalex-snapshot
Graph Computing Systems and Partitioning Techniques: A Survey
inferred← citeshttps://doi.org/10.1109/bigdata52589.2021.9671621openalex-snapshot
Optimizing Iterative Algorithms for Social Network Sharding
inferred← citeshttps://doi.org/10.1109/cis.2019.00035openalex-snapshot
NOLGP: A Novel Optimized Large-Scale Graph Partitioning Algorithm
inferred← citeshttps://doi.org/10.1109/cloud53861.2021.00100openalex-snapshot
Challenges of Distributed Computing for Pandemic Spread Prediction based on Large-Scale Human Interaction Data
inferred← citeshttps://doi.org/10.1109/dac63849.2025.11132788openalex-snapshot
GraphAccel: An In-Storage Accelerator for Efficient Graph-Based Vector Similarity Search Using Page Packing and Speculative Search Optimization
inferred← citeshttps://doi.org/10.1109/hpec58863.2023.10363585openalex-snapshot
Fast Spectral Graph Partitioning with a Randomized Eigensolver
inferred← citeshttps://doi.org/10.1109/ia351965.2020.00013openalex-snapshot
Distributed Memory Graph Coloring Algorithms for Multiple GPUs
inferred← citeshttps://doi.org/10.1109/icdcs57875.2023.00079openalex-snapshot
Lightweight Streaming Graph Partitioning by Fully Utilizing Knowledge from Local View
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00019openalex-snapshot
MPC: Minimum Property-Cut RDF Graph Partitioning
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00242openalex-snapshot
Out-of-Core Edge Partitioning at Linear Run-Time
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00083openalex-snapshot
Optimizing Graph Partition by Optimal Vertex-Cut: A Holistic Approach
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00185openalex-snapshot
Partitioner Selection with EASE to Optimize Distributed Graph Processing
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00169openalex-snapshot
Graph Computation with Adaptive Granularity
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00184openalex-snapshot
PAT: Towards Transaction Routing with Page Affinity in Shared-Cache Databases
inferred← citeshttps://doi.org/10.1109/ipdps.2018.00097openalex-snapshot
Experimental Design of Work Chunking for Graph Algorithms on High Bandwidth Memory Architectures
inferred← citeshttps://doi.org/10.1109/ipdps.2019.00054openalex-snapshot
CuSP: A Customizable Streaming Edge Partitioner for Distributed Graph Analytics
inferred← citeshttps://doi.org/10.1109/ipdps47924.2020.00019openalex-snapshot
A Study of Graph Analytics for Massive Datasets on Distributed Multi-GPUs
inferred← citeshttps://doi.org/10.1109/ipdps64566.2025.00033openalex-snapshot
Tera-Scale Multilevel Graph Partitioning
inferred← citeshttps://doi.org/10.1109/micro50266.2020.00078openalex-snapshot
GraphPulse: An Event-Driven Hardware Accelerator for Asynchronous Graph Processing
inferred← citeshttps://doi.org/10.1109/pact.2019.00010openalex-snapshot
Gluon-Async: A Bulk-Asynchronous System for Distributed and Heterogeneous Graph Analytics
inferred← citeshttps://doi.org/10.1109/tbdata.2021.3070194openalex-snapshot
A Two-phase Method to Balance the Result of Distributed Graph Repartitioning
inferred← citeshttps://doi.org/10.1109/tkde.2020.3022014openalex-snapshot
Distributed Hypergraph Processing Using Intersection Graphs
inferred← citeshttps://doi.org/10.1109/tpds.2020.3002150openalex-snapshot
Scalable, Multi-Constraint, Complex-Objective Graph Partitioning
inferred← citeshttps://doi.org/10.1109/tpds.2020.3032709openalex-snapshot
Accelerating Large-Scale Prioritized Graph Computations by Hotness Balanced Partition
inferred← citeshttps://doi.org/10.1109/tpds.2021.3069292openalex-snapshot
Group Reassignment for Dynamic Edge Partitioning
inferred← citeshttps://doi.org/10.1137/1.9781611976472.1openalex-snapshot
Multilevel Acyclic Hypergraph Partitioning
inferred← citeshttps://doi.org/10.1137/15m1027814openalex-snapshot
Improving Unstructured Mesh Partitions for Multiple Criteria Using Mesh Adjacencies
inferred← citeshttps://doi.org/10.1145/3035918.3035942openalex-snapshot
Parallelizing Sequential Graph Computations
inferred← citeshttps://doi.org/10.1145/3183713.3196918openalex-snapshot
Adaptive Asynchronous Parallelization of Graph Algorithms
inferred← citeshttps://doi.org/10.1145/3225058.3225148openalex-snapshot
Balanced k-means for Parallel Geometric Partitioning
inferred← citeshttps://doi.org/10.1145/3277006.3277011openalex-snapshot
From Think Parallel to Think Sequential
inferred← citeshttps://doi.org/10.1145/3282488openalex-snapshot
Parallelizing Sequential Graph Computations
inferred← citeshttps://doi.org/10.1145/3397491openalex-snapshot
Adaptive Asynchronous Parallelization of Graph Algorithms
inferred← citeshttps://doi.org/10.1145/3422575.3422801openalex-snapshot
Things to Consider to Enable Dynamic Graphs in Processing-in-Memory
inferred← citeshttps://doi.org/10.1145/3448016.3457300openalex-snapshot
Hybrid Edge Partitioner: Partitioning Large Power-Law Graphs under Memory Constraints
inferred← citeshttps://doi.org/10.1145/3472456.3475737openalex-snapshot
HiPa: Hierarchical Partitioning for Fast PageRank on NUMA Multicore Systems
inferred← citeshttps://doi.org/10.1145/3712285.3759863openalex-snapshot
AMRaCut: Scalable Partitioning for Adaptive Mesh Refinement
inferred← citeshttps://doi.org/10.14778/3297753.3297754openalex-snapshot
A study of partitioning policies for graph analytics on large-scale distributed platforms
inferred← citeshttps://doi.org/10.14778/3358701.3358706openalex-snapshot
Distributed edge partitioning for trillion-edge graphs
inferred← citeshttps://doi.org/10.14778/3389133.3389142openalex-snapshot
Incrementalization of graph partitioning algorithms
inferred← citeshttps://doi.org/10.1515/itit-2019-0032openalex-snapshot
Scaling up network centrality computations – A brief overview
inferred← citeshttps://doi.org/10.2172/1853867openalex-snapshot
Sphynx: a parallel multi-GPU graph partitioner for distributed-memory systems.
inferred← citeshttps://doi.org/10.23919/date.2019.8714773openalex-snapshot
Scaling up Network Centrality Computations
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.