On the public citation graph
GrapH: Heterogeneity-Aware Graph Computation with Adaptive Partitioning
0 signed · 58 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/cpe.3224openalex-snapshot
Self‐adaptive workload classification and forecasting for proactive resource provisioning
inferredcites →https://doi.org/10.1007/978-3-319-02165-2_20openalex-snapshot
Discontinuous Galerkin for High Performance Computational Fluid Dynamics
inferredcites →https://doi.org/10.1016/j.ejor.2005.01.066openalex-snapshot
Iterated local search for the quadratic assignment problem
inferredcites →https://doi.org/10.1109/bigdata.2014.7004375openalex-snapshot
Architecture-aware graph repartitioning for data-intensive scientific computing
inferredcites →https://doi.org/10.1109/icdcs.2014.23openalex-snapshot
Adaptive Partitioning for Large-Scale Dynamic Graphs
inferredcites →https://doi.org/10.1109/icde.2013.6544855openalex-snapshot
Catch the Wind: Graph workload balancing on cloud
inferredcites →https://doi.org/10.1109/icppw.2014.25openalex-snapshot
GraphIVE: Heterogeneity-Aware Adaptive Graph Partitioning in GraphLab
inferredcites →https://doi.org/10.1109/infcom.2012.6195556openalex-snapshot
VDN: Virtual machine image distribution network for cloud data centers
inferredcites →https://doi.org/10.1109/tc.2013.121openalex-snapshot
From the Cloud to the Atmosphere: Running MapReduce across Data Centers
inferredcites →https://doi.org/10.1109/tits.2014.2310951openalex-snapshot
Cooperative Bayesian Estimation of Vehicular Traffic in Large-Scale Networks
inferredcites →https://doi.org/10.1109/tkde.2014.2377743openalex-snapshot
Heterogeneous Environment Aware Streaming Graph Partitioning
inferredcites →https://doi.org/10.1109/wsc.2014.7019940openalex-snapshot
Towards billion-scale social simulations
inferredcites →https://doi.org/10.1137/05064299xopenalex-snapshot
Improved Approximation Algorithms for Minimum Weight Vertex Separators
inferredcites →https://doi.org/10.1145/2018436.2018465openalex-snapshot
Towards predictable datacenter networks
inferredcites →https://doi.org/10.1145/2043164.2018465openalex-snapshot
Towards predictable datacenter networks
inferredcites →https://doi.org/10.1145/2213836.2213895openalex-snapshot
Towards effective partition management for large graphs
inferredcites →https://doi.org/10.1145/2391229.2391232openalex-snapshot
Improving large graph processing on partitioned graphs in the cloud
inferredcites →https://doi.org/10.1145/2785956.2787505openalex-snapshot
Low Latency Geo-distributed Data Analytics
inferredcites →https://doi.org/10.1152/ajpheart.00794.2003openalex-snapshot
A model for human ventricular tissue
inferredcites →https://doi.org/10.14778/2095686.2095690openalex-snapshot
Capturing topology in graph pattern matching
inferredcites →https://doi.org/10.48550/arxiv.1511.02586openalex-snapshot
S-PowerGraph: Streaming Graph Partitioning for Natural Graphs by Vertex-Cut
inferredcites →https://doi.org/10.5555/2387880.2387883openalex-snapshot
PowerGraph: distributed graph-parallel computation on natural graphs
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-319-69462-7_27openalex-snapshot
Knowledge Is at the Edge! How to Search in Distributed Machine Learning Models
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/s10619-019-07256-zopenalex-snapshot
An investigation of big graph partitioning methods for distribution of graphs in vertex-centric systems
inferred← citeshttps://doi.org/10.1016/j.future.2019.07.014openalex-snapshot
Placing big graph into cloud for parallel processing with a two-phase community-aware approach
inferred← citeshttps://doi.org/10.1109/bigdata.2016.7840614openalex-snapshot
Argo: Architecture-aware graph partitioning
inferred← citeshttps://doi.org/10.1109/iccad57390.2023.10323998openalex-snapshot
Memory-aware Scheduling for Complex Wired Networks with Iterative Graph Optimization
inferred← citeshttps://doi.org/10.1109/icdcs.2017.98openalex-snapshot
On Achieving Efficient Data Transfer for Graph Processing in Geo-Distributed Datacenters
inferred← citeshttps://doi.org/10.1109/icdcs.2018.00072openalex-snapshot
ADWISE: Adaptive Window-Based Streaming Edge Partitioning for High-Speed Graph Processing
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00199openalex-snapshot
XTree: Traversal-Based Partitioning for Extreme-Scale Graph Processing on Supercomputers
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00256openalex-snapshot
Adaptive Partitioning for Large-Scale Graph Analytics in Geo-Distributed Data Centers
inferred← citeshttps://doi.org/10.1109/infocom.2018.8486361openalex-snapshot
A Hierarchical Synchronous Parallel Model for Wide-Area Graph Analytics
inferred← citeshttps://doi.org/10.1109/tbdata.2020.3019641openalex-snapshot
GGraph: An Efficient Structure-Aware Approach for Iterative Graph Processing
inferred← citeshttps://doi.org/10.1109/tpds.2018.2794989openalex-snapshot
GrapH: Traffic-Aware Graph Processing
inferred← citeshttps://doi.org/10.1109/tpds.2019.2955494openalex-snapshot
Cost-Aware Partitioning for Efficient Large Graph Processing in Geo-Distributed Datacenters
inferred← citeshttps://doi.org/10.1109/tpds.2025.3557610openalex-snapshot
Distributed and Adaptive Partitioning for Large Graphs in Geo-Distributed Data Centers
inferred← citeshttps://doi.org/10.1109/tsc.2017.2778737openalex-snapshot
GraphA: Efficient Partitioning and Storage for Distributed Graph Computation
inferred← citeshttps://doi.org/10.1145/3696410.3714741openalex-snapshot
GraphCom: Communication Hierarchy-aware Graph Engine for Distributed Model Training
inferred← citeshttps://doi.org/10.1145/3749175openalex-snapshot
NeutronHeter: Optimizing Distributed Graph Neural Network Training for Heterogeneous Clusters
inferred← citeshttps://doi.org/10.14778/3055540.3055543openalex-snapshot
An experimental comparison of partitioning strategies in distributed graph processing
inferred← citeshttps://doi.org/10.18419/opus-9262openalex-snapshot
Graph partitioning and scheduling for distributed dataflow computation
inferred← citeshttps://doi.org/10.35940/ijeat.a1085.1291s319openalex-snapshot
Smart Helmet: Thresh-Learner–Online Machine Learning on Data Streams
inferred← citeshttps://doi.org/10.48550/arxiv.1706.08420openalex-snapshot
StreamLearner: Distributed Incremental Machine Learning on Event Streams: Grand Challenge
inferred← citeshttps://doi.org/10.48550/arxiv.1805.11900openalex-snapshot
Q-Graph: Preserving Query Locality in Multi-Query Graph Processing
inferred← citeshttps://doi.org/10.48550/arxiv.1806.00907openalex-snapshot
A Structure-aware Approach for Efficient Graph Processing
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.