On the public citation graph
Fast Iterative Graph Computation: A Path Centric Approach
0 signed · 106 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.605openalex-snapshot
Parallel static and dynamic multi‐constraint graph partitioning
inferredcites →https://doi.org/10.1007/978-3-540-69501-1_6openalex-snapshot
Architecture Aware Partitioning Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-76298-0_16openalex-snapshot
YARS2: A Federated Repository for Querying Graph Structured Data from the Web
inferredcites →https://doi.org/10.1007/978-3-642-16720-1_3openalex-snapshot
HyperGraphDB: A Generalized Graph Database
inferredcites →https://doi.org/10.1007/s00778-009-0165-yopenalex-snapshot
The RDF-3X engine for scalable management of RDF data
inferredcites →https://doi.org/10.1109/cluster.2013.6702635openalex-snapshot
FlexQuery: An online query system for interactive remote visual data exploration at large scale
inferredcites →https://doi.org/10.1109/iccad.2003.159757openalex-snapshot
Multi-objective hypergraph partitioning algorithms for cut and maximum subdomain degree minimization
inferredcites →https://doi.org/10.1109/ipdps.2006.1639360openalex-snapshot
Multilevel algorithms for partitioning power-law graphs
inferredcites →https://doi.org/10.1109/sc.2005.4openalex-snapshot
A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L
inferredcites →https://doi.org/10.1109/sc.2010.34openalex-snapshot
Multithreaded Asynchronous Graph Traversal for In-Memory and Semi-External Memory
inferredcites →https://doi.org/10.1109/tcad.2005.854637openalex-snapshot
Multiobjective hypergraph-partitioning algorithms for cut and maximum subdomain-degree minimization
inferredcites →https://doi.org/10.1145/1048935.1050206openalex-snapshot
Multi-Constraint Mesh Partitioning for Contact/Impact Computations
inferredcites →https://doi.org/10.1145/1559845.1559911openalex-snapshot
Scalable join processing on very large RDF graphs
inferredcites →https://doi.org/10.1145/1940747.1940751openalex-snapshot
High-performance, massively scalable distributed systems using the MapReduce software framework
inferredcites →https://doi.org/10.1145/2503210.2503302openalex-snapshot
Efficient data partitioning model for heterogeneous graphs in the cloud
inferredcites →https://doi.org/10.1184/r1/6605999openalex-snapshot
GraphChi: Large-Scale Graph Computation on Just a PC
inferredcites →https://doi.org/10.14778/2556549.2556581openalex-snapshot
Fast iterative graph computation with block updates
inferredcites →https://doi.org/10.14778/2732232.2732238openalex-snapshot
From "think like a vertex" to "think like a graph"
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-030-05054-2_5openalex-snapshot
LMCC: Lazy Message and Centralized Cache for Asynchronous Graph Computing
inferred← citeshttps://doi.org/10.1007/978-3-030-38961-1_5openalex-snapshot
Pimiento: A Vertex-Centric Graph-Processing Framework on a Single Machine
inferred← citeshttps://doi.org/10.1007/978-3-319-72395-2_68openalex-snapshot
Research on Graph Processing Systems on a Single Machine
inferred← citeshttps://doi.org/10.1007/978-981-15-3928-2_2openalex-snapshot
Graph Computing Systems for Large-Scale Graph Analysis
inferred← citeshttps://doi.org/10.1007/s10766-017-0533-yopenalex-snapshot
WolfPath: Accelerating Iterative Traversing-Based Graph Processing Algorithms on GPU
inferred← citeshttps://doi.org/10.1007/s11227-016-1834-4openalex-snapshot
Intelligent and independent processes for overcoming big graphs
inferred← citeshttps://doi.org/10.1007/s11227-017-2049-zopenalex-snapshot
ANG: a combination of Apriori and graph computing techniques for frequent itemsets mining
inferred← citeshttps://doi.org/10.1007/s11227-019-02770-4openalex-snapshot
Listing all maximal cliques in large graphs on vertex-centric model
inferred← citeshttps://doi.org/10.1007/s11227-019-03097-wopenalex-snapshot
GraphMap: scalable iterative graph processing using NoSQL
inferred← citeshttps://doi.org/10.1007/s11227-021-03716-5openalex-snapshot
Distributed and incremental travelling salesman algorithm on time-evolving graphs
inferred← citeshttps://doi.org/10.1007/s11227-026-08638-8openalex-snapshot
Kedagraph: memory-efficient out-of-core graph processing system with high applicability
inferred← citeshttps://doi.org/10.1007/s11390-019-1914-zopenalex-snapshot
A Survey on Graph Processing Accelerators: Challenges and Opportunities
inferred← citeshttps://doi.org/10.1007/s11432-020-3248-yopenalex-snapshot
Towards efficient allocation of graph convolutional networks on hybrid computation-in-memory architecture
inferred← citeshttps://doi.org/10.1007/s11704-018-7443-zopenalex-snapshot
An effective framework for asynchronous incremental graph processing
inferred← citeshttps://doi.org/10.1007/s13222-017-0255-8openalex-snapshot
Big Graph Data Analytics on Single Machines – An Overview
inferred← citeshttps://doi.org/10.1007/s42514-020-00041-wopenalex-snapshot
Effective runtime scheduling for high-performance graph processing on heterogeneous dataflow architecture
inferred← citeshttps://doi.org/10.1016/j.future.2019.09.052openalex-snapshot
WolfGraph: The edge-centric graph processing on GPU
inferred← citeshttps://doi.org/10.1016/j.jpdc.2017.09.007openalex-snapshot
Accelerating breadth-first graph search on a single server by dynamic edge trimming
inferred← citeshttps://doi.org/10.1093/nsr/nww001openalex-snapshot
High-performance computing environment: a review of twenty years of experiments in China
inferred← citeshttps://doi.org/10.1109/icdcs.2017.150openalex-snapshot
Towards Dataflow-Based Graph Accelerator
inferred← citeshttps://doi.org/10.1109/icdcs.2019.00168openalex-snapshot
Big RDF Data Storage, Computation, and Analysis: A Strawman's Arguments
inferred← citeshttps://doi.org/10.1109/icde.2018.00152openalex-snapshot
GraphZ: Improving the Performance of Large-Scale Graph Analytics on Small-Scale Machines
inferred← citeshttps://doi.org/10.1109/icdmw.2018.00144openalex-snapshot
Review of Graph Processing Frameworks
inferred← citeshttps://doi.org/10.1109/ipdps.2016.71openalex-snapshot
FastBFS: Fast Breadth-First Graph Search on a Single Server
inferred← citeshttps://doi.org/10.1109/mnet.2017.1500138nmopenalex-snapshot
FRANK: A Fast Node Ranking Approach in Large-Scale Networks
inferred← citeshttps://doi.org/10.1109/sc.2016.70openalex-snapshot
G-Store: High-Performance Graph Store for Trillion-Edge Processing
inferred← citeshttps://doi.org/10.1109/snams.2018.8554525openalex-snapshot
The Taxonomy of Distributed Graph Analytics
inferred← citeshttps://doi.org/10.1109/soca.2017.13openalex-snapshot
Distributed PathGraph: A Cluster Centric Framework for Distributed Processing Graph
inferred← citeshttps://doi.org/10.1109/tbdata.2019.2921358openalex-snapshot
Efficient Graph Processing with Invalid Update Filtration
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/tc.2016.2624289openalex-snapshot
HotGraph: Efficient Asynchronous Processing for Real-World Graphs
inferred← citeshttps://doi.org/10.1109/tcss.2020.3029569openalex-snapshot
Linked Data Processing for Human-in-the-Loop in Cyber–Physical Systems
inferred← citeshttps://doi.org/10.1109/tkde.2022.3171588openalex-snapshot
EGraph: Efficient Concurrent GPU-based Dynamic Graph Processing
inferred← citeshttps://doi.org/10.1109/tpds.2016.2518664openalex-snapshot
PathGraph: A Path Centric Graph Processing System
inferred← citeshttps://doi.org/10.1109/tpds.2017.2776115openalex-snapshot
Efficient Disk-Based Directed Graph Processing: A Strongly Connected Component Approach
inferred← citeshttps://doi.org/10.1145/2749246.2749258openalex-snapshot
Fast Iterative Graph Computation with Resource Aware Graph Parallel Abstractions
inferred← citeshttps://doi.org/10.1145/2807591.2807604openalex-snapshot
Scaling iterative graph computations with GraphMap
inferred← citeshttps://doi.org/10.1145/3018787openalex-snapshot
Shared-Memory Parallelism Can Be Simple, Fast, and Scalable
inferred← citeshttps://doi.org/10.1145/3018787.3018791openalex-snapshot
Internally Deterministic Parallelism: Techniques and Algorithms
inferred← citeshttps://doi.org/10.1145/3018787.3018792openalex-snapshot
Deterministic Parallelism in Sequential Iterative Algorithms
inferred← citeshttps://doi.org/10.1145/3018787.3018793openalex-snapshot
A Deterministic Phase-Concurrent Parallel Hash Table
inferred← citeshttps://doi.org/10.1145/3018787.3018794openalex-snapshot
Priority Updates: A Contention-Reducing Primitive for Deterministic Programming
inferred← citeshttps://doi.org/10.1145/3018787.3018795openalex-snapshot
Ligra: A Lightweight Graph Processing Framework for Shared Memory
inferred← citeshttps://doi.org/10.1145/3018787.3018796openalex-snapshot
Ligra+: Adding Compression to Ligra
inferred← citeshttps://doi.org/10.1145/3018787.3018797openalex-snapshot
Linear-Work Parallel Graph Connectivity
inferred← citeshttps://doi.org/10.1145/3018787.3018798openalex-snapshot
Parallel and Cache-Oblivious Triangle Computations
inferred← citeshttps://doi.org/10.1145/3018787.3018799openalex-snapshot
Parallel Cartesian Tree and Suffix Tree Construction
inferred← citeshttps://doi.org/10.1145/3018787.3018800openalex-snapshot
Parallel Computation of Longest Common Prefixes
inferred← citeshttps://doi.org/10.1145/3018787.3018801openalex-snapshot
Parallel Lempel-Ziv Factorization
inferred← citeshttps://doi.org/10.1145/3018787.3018802openalex-snapshot
Parallel Wavelet Tree Construction
inferred← citeshttps://doi.org/10.1145/3335783.3335786openalex-snapshot
An Efficient Graph Compressor Based on Adaptive Prefix Encoding
inferred← citeshttps://doi.org/10.1145/3567955.3567963openalex-snapshot
Glign: Taming Misaligned Graph Traversals in Concurrent Graph Processing
inferred← citeshttps://doi.org/10.1145/3673038.3673111openalex-snapshot
SpeedCore: Space-efficient and Dependency-aware GPU Parallel Framework for Core Decomposition
inferred← citeshttps://doi.org/10.1145/3725421openalex-snapshot
Using Process Calculus for Optimizing Data and Computation Sharing in Complex Stateful Parallel Computations
inferred← citeshttps://doi.org/10.1360/ssi-2025-0030openalex-snapshot
An efficient out-of-core graph processing system for second-order random walks
inferred← citeshttps://doi.org/10.1631/fitee.1900127openalex-snapshot
Large-scale graph processing systems: a survey
inferred← citeshttps://doi.org/10.31390/gradschool_theses.4710openalex-snapshot
Distributed Iterative Graph Processing Using NoSQL with Data Locality
inferred← citeshttps://doi.org/10.48550/arxiv.1507.04405openalex-snapshot
Thinking Like a Vertex: a Survey of Vertex-Centric Frameworks for Distributed Graph Processing
inferred← citeshttps://doi.org/10.48550/arxiv.2003.00680openalex-snapshot
Graph3S: A Simple, Speedy and Scalable Distributed Graph Processing System
inferred← citeshttps://doi.org/10.5555/3014904.3014999openalex-snapshot
G-store: high-performance graph store for trillion-edge processing
inferred← citeshttps://doi.org/10.5555/3026877.3026901openalex-snapshot
Gemini: a computation-centric distributed graph processing system
inferred← citeshttps://doi.org/10.5821/dissertation-2117-95691openalex-snapshot
Link prediction in large directed graphs
inferred← citeshttps://doi.org/10.82444/warw.33757129openalex-snapshot
CGraph : a correlations-aware approach for efficient concurrent iterative 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.