On the public citation graph

Big Graph Analytics Platforms

0 signed · 217 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jpdc.1997.1404openalex-snapshot
Multilevelk-way Partitioning Scheme for Irregular Graphs
inferredcites →https://doi.org/10.1007/11533719_72openalex-snapshot
New Streaming Algorithms for Counting Triangles in Graphs
inferredcites →https://doi.org/10.1007/978-0-387-88146-1openalex-snapshot
Statistical Analysis of Network Data: Methods and Models
inferredcites →https://doi.org/10.1007/978-3-540-87481-2_3openalex-snapshot
Effective Pruning Techniques for Mining Quasi-Cliques
inferredcites →https://doi.org/10.1007/978-3-642-24206-9_11openalex-snapshot
Dyna: Extending Datalog for Modern AI
inferredcites →https://doi.org/10.1007/978-3-642-40131-2_1openalex-snapshot
An Analytics-Aware Conceptual Model for Evolving Graphs
inferredcites →https://doi.org/10.1007/bf02289026openalex-snapshot
A New Status Index Derived from Sociometric Analysis
inferredcites →https://doi.org/10.1007/s00453-010-9401-5openalex-snapshot
On Dynamic Shortest Paths Problems
inferredcites →https://doi.org/10.1007/s00778-012-0299-1openalex-snapshot
Extending the power of datalog recursion
inferredcites →https://doi.org/10.1007/s00778-015-0405-2openalex-snapshot
NScale: neighborhood-centric large-scale graph analytics in the cloud
inferredcites →https://doi.org/10.1007/s10619-014-7140-3openalex-snapshot
The G* graph database: efficiently managing large distributed dynamic graphs
inferredcites →https://doi.org/10.1016/0196-6774(82)90013-xopenalex-snapshot
An O(n2log n) parallel max-flow algorithm
inferredcites →https://doi.org/10.1016/0743-1066(87)90004-5openalex-snapshot
A generalization of the differential approach to recursive query evaluation
inferredcites →https://doi.org/10.1016/j.tcs.2005.09.013openalex-snapshot
On graph problems in a semi-streaming model
inferredcites →https://doi.org/10.1016/s0169-7552(98)00110-xopenalex-snapshot
The anatomy of a large-scale hypertextual Web search engine
inferredcites →https://doi.org/10.1103/physreve.84.016105openalex-snapshot
Path lengths, correlations, and centrality in temporal networks
inferredcites →https://doi.org/10.1109/asonam.2010.17openalex-snapshot
Tracking the Evolution of Communities in Dynamic Social Networks
inferredcites →https://doi.org/10.1109/asonam.2012.254openalex-snapshot
Using Pregel-like Large Scale Graph Processing Frameworks for Social Network Analysis
inferredcites →https://doi.org/10.1109/icde.2009.132openalex-snapshot
Continuous Subgraph Pattern Search over Graph Streams
inferredcites →https://doi.org/10.1109/icde.2010.5447738openalex-snapshot
Hive - a petabyte scale data warehouse using Hadoop
inferredcites →https://doi.org/10.1109/icde.2011.5767921openalex-snapshot
Hyracks: A flexible and extensible foundation for data-intensive computing
inferredcites →https://doi.org/10.1109/icde.2011.5767930openalex-snapshot
SystemML: Declarative machine learning on MapReduce
inferredcites →https://doi.org/10.1109/icde.2012.12openalex-snapshot
Scalable and Numerically Stable Descriptive Statistics in SystemML
inferredcites →https://doi.org/10.1109/icde.2012.26openalex-snapshot
Lookup Tables: Fine-Grained Partitioning for Distributed Databases
inferredcites →https://doi.org/10.1109/icde.2013.6544815openalex-snapshot
Scalable maximum clique computation using MapReduce
inferredcites →https://doi.org/10.1109/icde.2013.6544832openalex-snapshot
SociaLite: Datalog extensions for efficient social network analysis
inferredcites →https://doi.org/10.1109/icde.2013.6544855openalex-snapshot
Catch the Wind: Graph workload balancing on cloud
inferredcites →https://doi.org/10.1109/icde.2013.6544892openalex-snapshot
Efficient snapshot retrieval over historical graph data
inferredcites →https://doi.org/10.1109/icde.2014.6816681openalex-snapshot
Continuous pattern detection over billion-edge graph using distributed framework
inferredcites →https://doi.org/10.1109/icde.2015.7113298openalex-snapshot
LLAMA: Efficient graph analytics using Large Multiversioned Arrays
inferredcites →https://doi.org/10.1109/icde.2015.7113340openalex-snapshot
Optimizing recursive queries with monotonic aggregates in DeALS
inferredcites →https://doi.org/10.1109/icde.2015.7113362openalex-snapshot
VENUS: Vertex-centric streamlined graph computation on a single PC
inferredcites →https://doi.org/10.1109/icde.2015.7113363openalex-snapshot
Dynamic interaction graphs with probabilistic edge decay
inferredcites →https://doi.org/10.1109/icdm.2009.14openalex-snapshot
PEGASUS: A Peta-Scale Graph Mining System Implementation and Observations
inferredcites →https://doi.org/10.1109/ipdps.2014.49openalex-snapshot
How Well Do Graph-Processing Platforms Perform? An Empirical Performance Evaluation and Analysis
inferredcites →https://doi.org/10.1109/tkde.2013.2297930openalex-snapshot
Disk-Based Management of Interaction Graphs
inferredcites →https://doi.org/10.1109/tkde.2014.2327037openalex-snapshot
PAGE: A Partition Aware Engine for Parallel Graph Computation
inferredcites →https://doi.org/10.1109/tpds.2013.111openalex-snapshot
Medusa: Simplified Graph Processing on GPUs
inferredcites →https://doi.org/10.1109/tpds.2013.235openalex-snapshot
Maiter: An Asynchronous Graph Processing Framework for Delta-Based Accumulative Iterative Computation
inferredcites →https://doi.org/10.1109/tvcg.2013.238openalex-snapshot
A Task Taxonomy for Network Evolution Analysis
inferredcites →https://doi.org/10.1137/1.9780898719918openalex-snapshot
Graph Algorithms in the Language of Linear Algebra
inferredcites →https://doi.org/10.1145/1013367.1013519openalex-snapshot
On the temporal dimension of search
inferredcites →https://doi.org/10.1145/1150402.1150462openalex-snapshot
A framework for analysis of dynamic social networks
inferredcites →https://doi.org/10.1145/1165389.945450openalex-snapshot
The Google file system
inferredcites →https://doi.org/10.1145/129888.129894openalex-snapshot
Parallel database systems
inferredcites →https://doi.org/10.1145/1401890.1401898openalex-snapshot
Efficient semi-streaming algorithms for local triangle counting in massive graphs
inferredcites →https://doi.org/10.1145/152610.152611openalex-snapshot
Query evaluation techniques for large databases
inferredcites →https://doi.org/10.1145/16856.16859openalex-snapshot
An amateur's introduction to recursive query processing strategies
inferredcites →https://doi.org/10.1145/1739041.1739095openalex-snapshot
An execution environment for C-SPARQL queries
inferredcites →https://doi.org/10.1145/1806596.1806638openalex-snapshot
FlumeJava
inferredcites →https://doi.org/10.1145/1807167.1807184openalex-snapshot
Pregel
inferredcites →https://doi.org/10.1145/1830252.1830263openalex-snapshot
Design patterns for efficient graph algorithms in MapReduce
inferredcites →https://doi.org/10.1145/1935826.1935914openalex-snapshot
Supervised random walks
inferredcites →https://doi.org/10.1145/1963405.1963491openalex-snapshot
Counting triangles and the curse of the last reducer
inferredcites →https://doi.org/10.1145/1963405.1963495openalex-snapshot
EP-SPARQL
inferredcites →https://doi.org/10.1145/2020408.2020457openalex-snapshot
Applying data mining techniques to address disaster information management challenges on mobile devices
inferredcites →https://doi.org/10.1145/2020408.2020580openalex-snapshot
GBASE
inferredcites →https://doi.org/10.1145/214451.214456openalex-snapshot
Distributed snapshots
inferredcites →https://doi.org/10.1145/2150976.2151013openalex-snapshot
Green-Marl
inferredcites →https://doi.org/10.1145/2213836.2213854openalex-snapshot
Managing large dynamic graphs efficiently
inferredcites →https://doi.org/10.1145/2339530.2339722openalex-snapshot
Streaming graph partitioning for large distributed graphs
inferredcites →https://doi.org/10.1145/2442516.2442530openalex-snapshot
Ligra
inferredcites →https://doi.org/10.1145/2463676.2467799openalex-snapshot
Trinity
inferredcites →https://doi.org/10.1145/2465351.2465369openalex-snapshot
Mizan
inferredcites →https://doi.org/10.1145/2484838.2484843openalex-snapshot
GPS
inferredcites →https://doi.org/10.1145/2487575.2487581openalex-snapshot
TurboGraph
inferredcites →https://doi.org/10.1145/2488388.2488433openalex-snapshot
WTF
inferredcites →https://doi.org/10.1145/2505515.2505753openalex-snapshot
"All roads lead to Rome"
inferredcites →https://doi.org/10.1145/2517349.2522738openalex-snapshot
Naiad
inferredcites →https://doi.org/10.1145/2517349.2522739openalex-snapshot
A lightweight infrastructure for graph analytics
inferredcites →https://doi.org/10.1145/2517349.2522740openalex-snapshot
X-Stream
inferredcites →https://doi.org/10.1145/2544137.2544162openalex-snapshot
Simplifying Scalable Graph Processing with a Domain-Specific Language
inferredcites →https://doi.org/10.1145/2588555.2612182openalex-snapshot
EAGr
inferredcites →https://doi.org/10.1145/2592798.2592799openalex-snapshot
Chronos
inferredcites →https://doi.org/10.1145/2600212.2600227openalex-snapshot
CuSha
inferredcites →https://doi.org/10.1145/2618243.2618282openalex-snapshot
Efficient temporal shortest path queries on evolving social graphs
inferredcites →https://doi.org/10.1145/2621934.2621936openalex-snapshot
MapGraph
inferredcites →https://doi.org/10.1145/2688500.2688508openalex-snapshot
SYNC or ASYNC: time to fuse for distributed graph-parallel computation
inferredcites →https://doi.org/10.1145/2723372.2749432openalex-snapshot
Resource Elasticity for Large-Scale Machine Learning
inferredcites →https://doi.org/10.1145/275487.275492openalex-snapshot
An overview of query optimization in relational systems
inferredcites →https://doi.org/10.1145/2815400.2815408openalex-snapshot
Chaos
inferredcites →https://doi.org/10.1145/2815400.2815410openalex-snapshot
Arabesque
inferredcites →https://doi.org/10.1145/28659.28662openalex-snapshot
Sets and negation in a logic data base language (LDL1)
inferredcites →https://doi.org/10.1145/568522.568525openalex-snapshot
A survey of rollback-recovery protocols in message-passing systems
inferredcites →https://doi.org/10.1145/6012.15399openalex-snapshot
Magic sets and other strange ways to implement logic programs (extended abstract)
inferredcites →https://doi.org/10.1184/r1/6475898openalex-snapshot
More Effective Distributed ML via a Stale Synchronous Parallel Parameter Server
inferredcites →https://doi.org/10.1184/r1/6605999openalex-snapshot
GraphChi: Large-Scale Graph Computation on Just a PC
inferredcites →https://doi.org/10.1201/b16132-52openalex-snapshot
Triangulations
inferredcites →https://doi.org/10.14778/1920841.1920964openalex-snapshot
On dense pattern mining in graph streams
inferredcites →https://doi.org/10.14778/2212351.2212354openalex-snapshot
Distributed GraphLab
inferredcites →https://doi.org/10.14778/2311906.2311907openalex-snapshot
Efficient subgraph matching on billion node graphs
inferredcites →https://doi.org/10.14778/2350229.2350245openalex-snapshot
Spinning fast iterative data flows
inferredcites →https://doi.org/10.14778/2350229.2350246openalex-snapshot
REX
inferredcites →https://doi.org/10.14778/2556549.2556572openalex-snapshot
Distributed socialite
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.14778/2732286.2732292openalex-snapshot
Hybrid parallelization strategies for large-scale machine learning in SystemML
inferredcites →https://doi.org/10.14778/2732286.2732294openalex-snapshot
Optimizing graph algorithms on pregel-like systems
inferredcites →https://doi.org/10.14778/2732977.2732980openalex-snapshot
An experimental comparison of pregel-like graph processing systems
inferredcites →https://doi.org/10.14778/2733004.2733013openalex-snapshot
Large-scale graph analytics in Aster 6
inferredcites →https://doi.org/10.14778/2733004.2733057openalex-snapshot
Vertexica
inferredcites →https://doi.org/10.14778/2733085.2733089openalex-snapshot
Pregel algorithms for graph connectivity problems with performance guarantees
inferredcites →https://doi.org/10.14778/2733085.2733103openalex-snapshot
Blogel
inferredcites →https://doi.org/10.14778/2735496.2735501openalex-snapshot
MOCgraph
inferredcites →https://doi.org/10.14778/2735496.2735504openalex-snapshot
Event pattern matching over graph streams
inferredcites →https://doi.org/10.14778/2735496.2735506openalex-snapshot
Fast failure recovery in distributed graph processing systems
inferredcites →https://doi.org/10.14778/2735508.2735517openalex-snapshot
Large-scale distributed graph computing systems
inferredcites →https://doi.org/10.14778/2777598.2777604openalex-snapshot
Giraph unchained
inferredcites →https://doi.org/10.14778/2809974.2809983openalex-snapshot
GraphMat
inferredcites →https://doi.org/10.14778/2809974.2809987openalex-snapshot
GraphTwist
inferredcites →https://doi.org/10.14778/2824032.2824052openalex-snapshot
Asynchronous and fault-tolerant recursive datalog evaluation in shared-nothing engines
inferredcites →https://doi.org/10.14778/2824032.2824077openalex-snapshot
One trillion edges
inferredcites →https://doi.org/10.14778/2824032.2824129openalex-snapshot
GraphGen
inferredcites →https://doi.org/10.14778/2904483.2904488openalex-snapshot
A general-purpose query-centric framework for querying big graphs
inferredcites →https://doi.org/10.14778/2994509.2994515openalex-snapshot
Compressed linear algebra for large-scale machine learning
inferredcites →https://doi.org/10.14778/3402707.3402713openalex-snapshot
On querying historical evolving graph sequences
inferredcites →https://doi.org/10.21276/ijre.2018.5.5.4openalex-snapshot
MapReduce: Simplified Data Processing on Large Cluster
inferredcites →https://doi.org/10.4230/lipics.snapl.2015.63openalex-snapshot
Yedalog: Exploring Knowledge at Scale
inferredcites →https://doi.org/10.48550/arxiv.1006.2880openalex-snapshot
Fast Incremental and Personalized PageRank
inferredcites →https://doi.org/10.48550/arxiv.1006.4990openalex-snapshot
GraphLab: A New Framework for Parallel Machine Learning
inferredcites →https://doi.org/10.48550/arxiv.1111.7167openalex-snapshot
gSketch: On Query Estimation in Graph Streams
inferredcites →https://doi.org/10.48550/arxiv.1407.0455openalex-snapshot
Pregelix: Big(ger) Graph Analytics on A Dataflow Engine
inferredcites →https://doi.org/10.48550/arxiv.1408.0500openalex-snapshot
FlashGraph: Processing Billion-Node Graphs on an Array of Commodity SSDs
inferredcites →https://doi.org/10.48550/arxiv.1412.5263openalex-snapshot
Graph Analytics using the Vertica Relational Database
inferredcites →https://doi.org/10.48550/arxiv.1509.08960openalex-snapshot
Storing and Analyzing Historical Graph Data at Scale
inferredcites →https://doi.org/10.48550/arxiv.1601.05590openalex-snapshot
Efficient Processing of Very Large Graphs in a Small Cluster
inferredcites →https://doi.org/10.48550/arxiv.1601.06496openalex-snapshot
Lightweight Fault Tolerance in Large-Scale Distributed Graph Processing
inferredcites →https://doi.org/10.48550/arxiv.1606.06450openalex-snapshot
Limited Random Walk Algorithm for Big Graph Data Clustering
inferredcites →https://doi.org/10.5555/1070432.1070537openalex-snapshot
Graph distances in the streaming model: the value of space
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.1002/cpe.7419openalex-snapshot
Improving the efficiency of graph algorithm executions on high‐performance computing
inferred← citeshttps://doi.org/10.1007/978-3-030-14177-6_2openalex-snapshot
Multi-model Database Management Systems - A Look Forward
inferred← citeshttps://doi.org/10.1007/978-3-030-33223-5_40openalex-snapshot
Parallel Clique-Like Subgraph Counting and Listing
inferred← citeshttps://doi.org/10.1007/978-3-319-58217-7_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-3-319-58217-7_2openalex-snapshot
Pregel-Like Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-58217-7_3openalex-snapshot
Hands-On Experiences
inferred← citeshttps://doi.org/10.1007/978-3-319-58217-7_4openalex-snapshot
Shared Memory Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-319-63962-8_272-1openalex-snapshot
Parallel Graph Processing
inferred← citeshttps://doi.org/10.1007/978-3-319-63962-8_272-2openalex-snapshot
Parallel Graph Processing
inferred← citeshttps://doi.org/10.1007/978-3-319-63962-8_344-1openalex-snapshot
Think-Like-a-Task Programming Model
inferred← citeshttps://doi.org/10.1007/978-3-319-77525-8_272openalex-snapshot
Parallel Graph Processing
inferred← citeshttps://doi.org/10.1007/978-3-319-96655-7_4openalex-snapshot
Historical Graphs: Models, Storage, Processing
inferred← citeshttps://doi.org/10.1007/s00778-021-00688-zopenalex-snapshot
G-thinker: a general distributed framework for finding qualified subgraphs in a big graph with load balancing
inferred← citeshttps://doi.org/10.1007/s00778-021-00712-2openalex-snapshot
Parallel mining of large maximal quasi-cliques
inferred← citeshttps://doi.org/10.1007/s11265-020-01595-2openalex-snapshot
Visualization Analysis of Knowledge Network Research Based on Mapping Knowledge
inferred← citeshttps://doi.org/10.1007/s11432-020-2952-7openalex-snapshot
Graph algorithms: parallelization and scalability
inferred← citeshttps://doi.org/10.1007/s11704-018-6400-1openalex-snapshot
A communication-reduced and computation-balanced framework for fast graph computation
inferred← citeshttps://doi.org/10.1016/j.future.2018.04.067openalex-snapshot
Profiling distributed graph processing systems through visual analytics
inferred← citeshttps://doi.org/10.1017/s0956796821000277openalex-snapshot
Fregel: a functional domain-specific language for vertex-centric large-scale graph processing
inferred← citeshttps://doi.org/10.1080/10447318.2022.2073007openalex-snapshot
Interactive Visual Exploration of Big Relational Datasets
inferred← citeshttps://doi.org/10.1109/bigdata47090.2019.9006290openalex-snapshot
A Modern Approach to Big Provenance
inferred← citeshttps://doi.org/10.1109/bigdata62323.2024.10825522openalex-snapshot
MALAGA - MultidimensionAL Big DAta Analytics over Massive Graph DAta
inferred← citeshttps://doi.org/10.1109/iccad66269.2025.11240912openalex-snapshot
ScanNow: A Scan Window-Based Sparse Matrix Multiplication Accelerator Design
inferred← citeshttps://doi.org/10.1109/icde48307.2020.00024openalex-snapshot
Kaskade: Graph Views for Efficient Graph Analytics
inferred← citeshttps://doi.org/10.1109/icde48307.2020.00122openalex-snapshot
G-thinker: A Distributed Framework for Mining Subgraphs in a Big Graph
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00082openalex-snapshot
Hybrid Subgraph Matching Framework Powered by Sketch Tree for Distributed Systems
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00022openalex-snapshot
Efficient Multi-GPU Graph Processing with Remote Work Stealing
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00142openalex-snapshot
Accelerating k-Core Decomposition by a GPU
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00238openalex-snapshot
Graphix: “One User's JSON is Another User's Graph”
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00245openalex-snapshot
G2-AIMD: A Memory-Efficient Subgraph-Centric Framework for Efficient Subgraph Finding on GPUs
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/ipdps.2019.00053openalex-snapshot
Composing Optimization Techniques for Vertex-Centric Graph Processing via Communication Channels
inferred← citeshttps://doi.org/10.1109/pdp52278.2021.00033openalex-snapshot
Boosting Graph Analytics by Tuning Threads and Data Affinity on NUMA Systems
inferred← citeshttps://doi.org/10.1109/tkde.2019.2950620openalex-snapshot
SQL-G: Efficient Graph Analytics by SQL
inferred← citeshttps://doi.org/10.1109/tkde.2021.3101057openalex-snapshot
ScaleG: A Distributed Disk-based System for Vertex-centric Graph Processing
inferred← citeshttps://doi.org/10.1109/tkde.2025.3537964openalex-snapshot
G-ThinkerQ: A General Subgraph Querying System With a Unified Task-Based Programming Model
inferred← citeshttps://doi.org/10.1109/tnet.2020.3020813openalex-snapshot
TopoX: Topology Refactorization for Minimizing Network Communication in Graph Computations
inferred← citeshttps://doi.org/10.1109/tpds.2017.2743708openalex-snapshot
GraphD: Distributed Vertex-Centric Graph Processing Beyond the Memory Limit
inferred← citeshttps://doi.org/10.1109/tpds.2018.2875084openalex-snapshot
Using High-Bandwidth Networks Efficiently for Fast Graph Computation
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/3210259.3210261openalex-snapshot
In situ graph querying and analytics with graphgen
inferred← citeshttps://doi.org/10.1145/3210377.3210414openalex-snapshot
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
inferred← citeshttps://doi.org/10.1145/3276491openalex-snapshot
GraphIt: a high-performance graph DSL
inferred← citeshttps://doi.org/10.1145/3277006.3277010openalex-snapshot
Technical Perspective:
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/3293883.3295716openalex-snapshot
A pattern based algorithmic autotuner for graph processing on GPUs
inferred← citeshttps://doi.org/10.1145/3314221.3314598openalex-snapshot
Low-latency graph streaming using compressed purely-functional trees
inferred← citeshttps://doi.org/10.1145/3332466.3374527openalex-snapshot
Practical parallel hypergraph algorithms
inferred← citeshttps://doi.org/10.1145/3357223.3362715openalex-snapshot
Grasper
inferred← citeshttps://doi.org/10.1145/3397491openalex-snapshot
Adaptive Asynchronous Parallelization of Graph Algorithms
inferred← citeshttps://doi.org/10.1145/3398682.3399168openalex-snapshot
The Graph Based Benchmark Suite (GBBS)
inferred← citeshttps://doi.org/10.1145/3434393openalex-snapshot
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
inferred← citeshttps://doi.org/10.1145/3448016.3457243openalex-snapshot
iTurboGraph
inferred← citeshttps://doi.org/10.1145/3448016.3457253openalex-snapshot
Cache-Efficient Fork-Processing Patterns on Large Graphs
inferred← citeshttps://doi.org/10.1145/3448016.3457314openalex-snapshot
Vertex-centric Parallel Computation of SQL Queries
inferred← citeshttps://doi.org/10.1145/3477602openalex-snapshot
Handling Iterations in Distributed Dataflow Systems
inferred← citeshttps://doi.org/10.1145/3626246.3658369openalex-snapshot
The Future of Graph Analytics
inferred← citeshttps://doi.org/10.1145/3627673.3679101openalex-snapshot
Systems for Scalable Graph Analytics and Machine Learning: Trends and Methods
inferred← citeshttps://doi.org/10.1145/3639315openalex-snapshot
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction
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/3698833openalex-snapshot
Automating Vectorized Distributed Graph Computation
inferred← citeshttps://doi.org/10.1145/3709665openalex-snapshot
BⓈ X : Subgraph Matching with Batch Backtracking Search
inferred← citeshttps://doi.org/10.1145/3721145.3725740openalex-snapshot
YH-Light: Yielding Hierarchy-aware Partitioner for Large-scale Graph Processing
inferred← citeshttps://doi.org/10.1145/3749159openalex-snapshot
BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching
inferred← citeshttps://doi.org/10.1145/3754598.3754637openalex-snapshot
CompreGel: Efficient Distributed Graph Propagation via Error-Bounded Lossy Message Compression
inferred← citeshttps://doi.org/10.1145/3802022openalex-snapshot
Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching
inferred← citeshttps://doi.org/10.1145/3810900.3810904openalex-snapshot
One Graph, Many Sources: Automating Vectorization Safely
inferred← citeshttps://doi.org/10.14778/3424573.3424579openalex-snapshot
Parallel graph algorithms in constant adaptive rounds
inferred← citeshttps://doi.org/10.14778/3447689.3447708openalex-snapshot
Teseo and the analysis of structural dynamic graphs
inferred← citeshttps://doi.org/10.14778/3749646.3749662openalex-snapshot
Accelerating Subgraph Matching through Fine-Grained and Powerful Equivalences
inferred← citeshttps://doi.org/10.14778/3750601.3750695openalex-snapshot
Systems for Scalable Graph Analytics and Machine Learning: Trends and Methods
inferred← citeshttps://doi.org/10.2200/s00873ed1v01y201808dtm051openalex-snapshot
Querying Graphs
inferred← citeshttps://doi.org/10.2200/s00895ed1v01y201901dtm057openalex-snapshot
Data Management in Machine Learning Systems
inferred← citeshttps://doi.org/10.3390/a18070445openalex-snapshot
Domain-Specific Languages for Algorithmic Graph Processing: A Systematic Literature Review
inferred← citeshttps://doi.org/10.3390/s18114020openalex-snapshot
Detecting Incremental Frequent Subgraph Patterns in IoT Environments
inferred← citeshttps://doi.org/10.37256/bsr.1120231921openalex-snapshot
Biological Network Mining
inferred← citeshttps://doi.org/10.48550/arxiv.1709.03110openalex-snapshot
G-thinker: Big Graph Mining Made Easier and Faster
inferred← citeshttps://doi.org/10.48550/arxiv.1805.00923openalex-snapshot
GraphIt: A High-Performance DSL for Graph Analytics
inferred← citeshttps://doi.org/10.48550/arxiv.1910.12310openalex-snapshot
Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs
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.48550/arxiv.2005.12873openalex-snapshot
Benchmarking Graph Data Management and Processing Systems: A Survey
inferred← citeshttps://doi.org/10.48550/arxiv.2009.11552openalex-snapshot
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice
inferred← citeshttps://doi.org/10.5753/sbbd.2026.249208openalex-snapshot
A systematic review of graph query language operators for graph analytics
inferred← citeshttps://doi.org/10.5753/wscad.2021.18518openalex-snapshot
Aumentando a Eficiência na Execução de Algoritmos de Grafos em HPC
inferred← citeshttps://doi.org/10.70675/24cfd0f4zaa30z4382z92c0ze696126ad6f0openalex-snapshot
Parallel and distributed algorithms for pattern matching in big graphs
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.