On the public citation graph

Play like a Vertex: A Stackelberg Game Approach for Streaming Graph Partitioning

0 signed · 62 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.1016/j.jalgor.2003.12.001openalex-snapshot
An improved data stream summary: the count-min sketch and its applications
inferredcites →https://doi.org/10.1038/35019019openalex-snapshot
Error and attack tolerance of complex networks
inferredcites →https://doi.org/10.1080/10691898.2011.11889611openalex-snapshot
Measuring Skewness: A Forgotten Statistic?
inferredcites →https://doi.org/10.1103/physrevlett.86.3682openalex-snapshot
Breakdown of the Internet under Intentional Attack
inferredcites →https://doi.org/10.1109/icdcs.2018.00072openalex-snapshot
ADWISE: Adaptive Window-Based Streaming Edge Partitioning for High-Speed Graph Processing
inferredcites →https://doi.org/10.1109/icde.2019.00103openalex-snapshot
Fast and Accurate Graph Stream Summarization
inferredcites →https://doi.org/10.1109/icde48307.2020.00122openalex-snapshot
G-thinker: A Distributed Framework for Mining Subgraphs in a Big Graph
inferredcites →https://doi.org/10.1109/icde53745.2022.00049openalex-snapshot
Clustering-based Partitioning for Large Web Graphs
inferredcites →https://doi.org/10.1109/icde53745.2022.00242openalex-snapshot
Out-of-Core Edge Partitioning at Linear Run-Time
inferredcites →https://doi.org/10.1109/icde53745.2022.00246openalex-snapshot
GX-Plug: a Middleware for Plugging Accelerators to Distributed Graph Processing
inferredcites →https://doi.org/10.1109/icde55515.2023.00083openalex-snapshot
Optimizing Graph Partition by Optimal Vertex-Cut: A Holistic Approach
inferredcites →https://doi.org/10.1109/icde55515.2023.00185openalex-snapshot
Partitioner Selection with EASE to Optimize Distributed Graph Processing
inferredcites →https://doi.org/10.1109/tcss.2022.3226230openalex-snapshot
A Streaming Graph Partitioning Method to Achieve High Cohesion and Equilibrium via Multiplayer Repeated Game
inferredcites →https://doi.org/10.1109/tkde.2021.3101057openalex-snapshot
ScaleG: A Distributed Disk-based System for Vertex-centric Graph Processing
inferredcites →https://doi.org/10.1109/tkde.2023.3320127openalex-snapshot
Multithreading Heterogeneous Graph Aggregation
inferredcites →https://doi.org/10.1109/tnet.2020.3020813openalex-snapshot
TopoX: Topology Refactorization for Minimizing Network Communication in Graph Computations
inferredcites →https://doi.org/10.1109/tpds.2018.2890515openalex-snapshot
Quasi-Streaming Graph Partitioning: A Game Theoretical Approach
inferredcites →https://doi.org/10.1111/j.1468-0297.2008.02185.xopenalex-snapshot
Stackelberg Competition with Endogenous Entry
inferredcites →https://doi.org/10.1137/0210054openalex-snapshot
The NP-Completeness of Some Edge-Partition Problems
inferredcites →https://doi.org/10.1137/05064299xopenalex-snapshot
Improved Approximation Algorithms for Minimum Weight Vertex Separators
inferredcites →https://doi.org/10.1137/1.9781611972740.43openalex-snapshot
R-MAT: A Recursive Model for Graph Mining
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/1772690.1772751openalex-snapshot
What is Twitter, a social network or a news media?
inferredcites →https://doi.org/10.1145/1807167.1807184openalex-snapshot
Pregel
inferredcites →https://doi.org/10.1145/1963405.1963488openalex-snapshot
Layered label propagation
inferredcites →https://doi.org/10.1145/2350190.2350193openalex-snapshot
Defining and evaluating network communities based on ground-truth
inferredcites →https://doi.org/10.1145/2484425.2484429openalex-snapshot
GraphBuilder
inferredcites →https://doi.org/10.1145/2623330.2623660openalex-snapshot
Balanced graph edge partition
inferredcites →https://doi.org/10.1145/2723372.2749450openalex-snapshot
Real-Time Multi-Criteria Social Graph Partitioning
inferredcites →https://doi.org/10.1145/2806416.2806424openalex-snapshot
HDRF
inferredcites →https://doi.org/10.1145/2882903.2915223openalex-snapshot
Graph Stream Summarization
inferredcites →https://doi.org/10.1145/3035918.3064014openalex-snapshot
TrillionG
inferredcites →https://doi.org/10.1145/3097983.3098033openalex-snapshot
Graph Edge Partitioning via Neighborhood Heuristic
inferredcites →https://doi.org/10.1145/3160017openalex-snapshot
BUbiNG
inferredcites →https://doi.org/10.1145/3298989openalex-snapshot
PowerLyra
inferredcites →https://doi.org/10.1145/3447548.3467276openalex-snapshot
Tail-GNN
inferredcites →https://doi.org/10.1145/3448016.3457300openalex-snapshot
Hybrid Edge Partitioner: Partitioning Large Power-Law Graphs under Memory Constraints
inferredcites →https://doi.org/10.1145/3458817.3480856openalex-snapshot
DistGNN
inferredcites →https://doi.org/10.1145/3533702.3534920openalex-snapshot
GCNSplit
inferredcites →https://doi.org/10.1145/3575693.3575725openalex-snapshot
Betty: Enabling Large-Scale GNN Training with Batch-Level Graph Partitioning
inferredcites →https://doi.org/10.1145/988672.988752openalex-snapshot
The webgraph framework I
inferredcites →https://doi.org/10.14778/2212351.2212354openalex-snapshot
Distributed GraphLab
inferredcites →https://doi.org/10.14778/2733085.2733103openalex-snapshot
Blogel
inferredcites →https://doi.org/10.14778/3352063.3352127openalex-snapshot
AliGraph
inferredcites →https://doi.org/10.14778/3358701.3358706openalex-snapshot
Distributed edge partitioning for trillion-edge graphs
inferredcites →https://doi.org/10.14778/3583140.3583154openalex-snapshot
Auxo: A Scalable and Efficient Graph Stream Summarization Structure

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.70580openalex-snapshot
A Vertex Partitioning Algorithm for Large‐Scale Uncertain Graphs
inferred← citeshttps://doi.org/10.1007/978-981-92-3391-5_26openalex-snapshot
A Parallel Local Edge Partitioning Algorithm with Global Boundary Optimization for Large-Scale Graphs
inferred← citeshttps://doi.org/10.1007/978-981-92-5696-9_15openalex-snapshot
CoaGrap-WLP: COmmunity-Aware GRAph Partitioning via Weighted Label Propagation
inferred← citeshttps://doi.org/10.1007/978-981-95-3462-3_4openalex-snapshot
DEPL: A Dual-Balanced Streaming Edge Partitioning in Linear Runtime
inferred← citeshttps://doi.org/10.1007/s00778-025-00938-4openalex-snapshot
Distributed Truss Decomposition over Large Directed Graphs
inferred← citeshttps://doi.org/10.1007/s10586-025-05338-5openalex-snapshot
A two-phase streaming edge partitioning algorithm for large-scale uncertain graphs
inferred← citeshttps://doi.org/10.1007/s10586-026-06406-0openalex-snapshot
Scalability and performance in distributed graph databases
inferred← citeshttps://doi.org/10.1007/s10588-026-09447-3openalex-snapshot
Distributed Graph Generation Using JDM Replication
inferred← citeshttps://doi.org/10.1038/s41598-025-16768-xopenalex-snapshot
A social network graph partitioning algorithm based on double deep Q-Network
inferred← citeshttps://doi.org/10.1109/jiot.2026.3685317openalex-snapshot
A Streaming Graph Hybrid Partitioning Method to Capture Multipatterns via the Incremental Lightweight GNN
inferred← citeshttps://doi.org/10.1109/tkde.2026.3667713openalex-snapshot
A Comprehensive Survey on Dynamic Graph Processing: Storage and Analytics
inferred← citeshttps://doi.org/10.1145/3709669openalex-snapshot
Capsule: An Out-of-Core Training Mechanism for Colossal GNNs
inferred← citeshttps://doi.org/10.1145/3709738openalex-snapshot
DiskGNN: Bridging I/O Efficiency and Model Accuracy for Out-of-Core GNN Training
inferred← citeshttps://doi.org/10.1145/3770854.3780266openalex-snapshot
SIGHP: Scalable Information-Guided Hypergraph Partitioner
inferred← citeshttps://doi.org/10.14778/3717755.3717756openalex-snapshot
Efficient Graph Embedding Generation and Update for Large-Scale Temporal Graph
inferred← citeshttps://doi.org/10.3390/app142210704openalex-snapshot
Dual Clustering-Based Method for Geospatial Knowledge Graph Partitioning
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.