On the public citation graph
A Survey of Distributed Graph Algorithms on Massive Graphs
0 signed · 184 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/nav.3800020109openalex-snapshot
The Hungarian method for the assignment problem
inferredcites →https://doi.org/10.1007/3-540-45307-5_8openalex-snapshot
Learning from the Success of MPI
inferredcites →https://doi.org/10.1007/978-3-319-09873-9_38openalex-snapshot
GoFFish: A Sub-graph Centric Framework for Large-Scale Graph Analytics
inferredcites →https://doi.org/10.1007/978-3-540-27798-9_19openalex-snapshot
The Worst-Case Time Complexity for Generating All Maximal Cliques
inferredcites →https://doi.org/10.1007/978-3-540-44833-4_5openalex-snapshot
JoCaml: A Language for Concurrent Distributed and Mobile Programming
inferredcites →https://doi.org/10.1007/s00446-018-0324-8openalex-snapshot
Fast distributed algorithms for testing graph properties
inferredcites →https://doi.org/10.1007/s00446-018-0326-6openalex-snapshot
Distributed distance computation and routing with small messages
inferredcites →https://doi.org/10.1007/s00446-020-00387-yopenalex-snapshot
Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model
inferredcites →https://doi.org/10.1007/s00446-021-00412-8openalex-snapshot
Single-source shortest paths in the CONGEST model with improved bounds
inferredcites →https://doi.org/10.1007/s00446-022-00426-wopenalex-snapshot
Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks
inferredcites →https://doi.org/10.1007/s00778-017-0457-6openalex-snapshot
Distributed shortest path query processing on dynamic road networks
inferredcites →https://doi.org/10.1007/s00778-019-00587-4openalex-snapshot
The core decomposition of networks: theory, algorithms and applications
inferredcites →https://doi.org/10.1007/s10115-019-01328-3openalex-snapshot
PPR-partitioning: a distributed graph partitioning algorithm based on the personalized PageRank vectors in vertex-centric systems
inferredcites →https://doi.org/10.1007/s10618-016-0466-xopenalex-snapshot
A distributed approach for graph mining in massive networks
inferredcites →https://doi.org/10.1007/s10619-018-7232-6openalex-snapshot
Distributed computing connected components with linear communication cost
inferredcites →https://doi.org/10.1007/s11227-021-04224-2openalex-snapshot
Scalable distributed Louvain algorithm for community detection in large graphs
inferredcites →https://doi.org/10.1007/s11432-021-3291-3openalex-snapshot
Toward the minimum vertex cover of complex networks using distributed potential games
inferredcites →https://doi.org/10.1016/j.artint.2004.09.003openalex-snapshot
Adopt: asynchronous distributed constraint optimization with quality guarantees
inferredcites →https://doi.org/10.1016/j.comnet.2013.05.001openalex-snapshot
DACCER: Distributed Assessment of the Closeness CEntrality Ranking in complex networks
inferredcites →https://doi.org/10.1016/j.future.2019.09.052openalex-snapshot
WolfGraph: The edge-centric graph processing on GPU
inferredcites →https://doi.org/10.1016/j.ins.2022.05.108openalex-snapshot
Distributed PageRank computation with improved round complexities
inferredcites →https://doi.org/10.1016/j.is.2019.03.014openalex-snapshot
KTMiner: Distributed k-truss detection in big graphs
inferredcites →https://doi.org/10.1016/j.jpdc.2014.08.011openalex-snapshot
Mining maximal cliques from a large graph using MapReduce: Tackling highly uneven subproblem sizes
inferredcites →https://doi.org/10.1016/j.jpdc.2014.09.013openalex-snapshot
Solutions to the st-connectivity problem using a GPU-based distributed BFS
inferredcites →https://doi.org/10.1016/j.jpdc.2016.06.003openalex-snapshot
Silent self-stabilizing BFS tree algorithms revisited
inferredcites →https://doi.org/10.1016/j.jpdc.2017.11.003openalex-snapshot
Exploiting social network graph characteristics for efficient BFS on heterogeneous chips
inferredcites →https://doi.org/10.1016/j.jpdc.2020.08.010openalex-snapshot
Distributed approximate k -core decomposition and min–max edge orientation: Breaking the diameter barrier
inferredcites →https://doi.org/10.1016/j.jpdc.2022.07.003openalex-snapshot
A fast parallel max-flow algorithm
inferredcites →https://doi.org/10.1016/j.physa.2018.02.130openalex-snapshot
PSPLPA: Probability and similarity based parallel label propagation algorithm on spark
inferredcites →https://doi.org/10.1016/j.procs.2017.08.045openalex-snapshot
An evidential influence-based label propagation algorithm for distributed community detection in social networks
inferredcites →https://doi.org/10.1016/j.tcs.2014.04.003openalex-snapshot
Fast distributed PageRank computation
inferredcites →https://doi.org/10.1016/j.tcs.2016.12.023openalex-snapshot
On the distribution of betweenness centrality in random trees
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.1016/s1389-1286(00)00083-9openalex-snapshot
Graph structure in the Web
inferredcites →https://doi.org/10.1017/s0956796802004343openalex-snapshot
Parallel and Distributed Haskells
inferredcites →https://doi.org/10.1080/0022250x.2001.9990249openalex-snapshot
A faster algorithm for betweenness centrality*
inferredcites →https://doi.org/10.1088/1742-5468/2008/10/p10008openalex-snapshot
Fast unfolding of communities in large networks
inferredcites →https://doi.org/10.1093/bioinformatics/bti1007openalex-snapshot
Protein function prediction via graph kernels
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.7004264openalex-snapshot
Distributed algorithms for k-truss decomposition
inferredcites →https://doi.org/10.1109/bigdata.2017.8258018openalex-snapshot
A distributed k-core decomposition algorithm on spark
inferredcites →https://doi.org/10.1109/bigdata.congress.2014.31openalex-snapshot
Distributed Maximal Clique Computation
inferredcites →https://doi.org/10.1109/cluster.2013.6702680openalex-snapshot
STREAMER: A distributed framework for incremental closeness centrality computation
inferredcites →https://doi.org/10.1109/cluster.2015.62openalex-snapshot
Distributed-Memory Algorithms for Maximal Cardinality Matching Using Matrix Algebra
inferredcites →https://doi.org/10.1109/cluster.2018.00044openalex-snapshot
A Scalable Distributed Louvain Algorithm for Large-Scale Graph Community Detection
inferredcites →https://doi.org/10.1109/dasc/picom/datacom/cyberscitec.2018.00122openalex-snapshot
Parallelizing Louvain Algorithm: Distributed Memory Challenges
inferredcites →https://doi.org/10.1109/focs.2018.00071openalex-snapshot
A Faster Distributed Single-Source Shortest Paths Algorithm
inferredcites →https://doi.org/10.1109/hpec43674.2020.9286167openalex-snapshot
TriC: Distributed-memory Triangle Counting by Exploiting the Graph Structure
inferredcites →https://doi.org/10.1109/hpec55821.2022.9926376openalex-snapshot
Improved Distributed-memory Triangle Counting by Exploiting the Graph Structure
inferredcites →https://doi.org/10.1109/ia351965.2020.00013openalex-snapshot
Distributed Memory Graph Coloring Algorithms for Multiple GPUs
inferredcites →https://doi.org/10.1109/icassp39728.2021.9413643openalex-snapshot
Provably Fast Asynchronous And Distributed Algorithms For Pagerank Centrality Computation
inferredcites →https://doi.org/10.1109/icdcs.2016.89openalex-snapshot
Nearly Optimal Distributed Algorithm for Computing Betweenness Centrality
inferredcites →https://doi.org/10.1109/icde.2016.7498232openalex-snapshot
VColor: A practical vertex-cut based approach for coloring large graphs
inferredcites →https://doi.org/10.1109/icde.2017.92openalex-snapshot
UniWalk: Unidirectional Random Walk Based Scalable SimRank Computation over Large Graph
inferredcites →https://doi.org/10.1109/ipdps.2014.96openalex-snapshot
Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems
inferredcites →https://doi.org/10.1109/ipdps.2018.00098openalex-snapshot
Distributed Louvain Algorithm for Graph Community Detection
inferredcites →https://doi.org/10.1109/ipdps47924.2020.00118openalex-snapshot
Communication-Efficient Jaccard similarity for High-Performance Distributed Genome Comparisons
inferredcites →https://doi.org/10.1109/ipdps53621.2022.00037openalex-snapshot
Communication-efficient Massively Distributed Connected Components
inferredcites →https://doi.org/10.1109/ipdps54959.2023.00076openalex-snapshot
Engineering a Distributed-Memory Triangle Counting Algorithm
inferredcites →https://doi.org/10.1109/iscas51556.2021.9401117openalex-snapshot
A Minimal Memory Game-Based Distributed Algorithm to Vertex Cover of Networks
inferredcites →https://doi.org/10.1109/mcse.2022.3152945openalex-snapshot
PyCOMPSs as an Instrument for Translational Computer Science
inferredcites →https://doi.org/10.1109/sc.2014.50openalex-snapshot
Faster Parallel Traversal of Scale Free Graphs at Extreme Scale with Vertex Delegates
inferredcites →https://doi.org/10.1109/sc41404.2022.00024openalex-snapshot
Scaling Graph 500 SSSP to 140 Trillion Edges with over 40 Million Cores
inferredcites →https://doi.org/10.1109/surv.2012.111412.00045openalex-snapshot
A Review on Distributed Application Processing Frameworks in Smart Mobile Devices for Mobile Cloud Computing
inferredcites →https://doi.org/10.1109/tac.2022.3209446openalex-snapshot
A Scalable Distributed Dynamical Systems Approach to Learn the Strongly Connected Components and Diameter of Networks
inferredcites →https://doi.org/10.1109/tcad.2018.2821565openalex-snapshot
GraphH: A Processing-in-Memory Architecture for Large-Scale Graph Processing
inferredcites →https://doi.org/10.1109/tkde.2017.2762294openalex-snapshot
High-Level Programming Abstractions for Distributed Graph Processing
inferredcites →https://doi.org/10.1109/tkde.2019.2936027openalex-snapshot
Efficient Distributed k-clique Mining for Large Networks Using MapReduce
inferredcites →https://doi.org/10.1109/tnet.2015.2417861openalex-snapshot
Distributed Greedy Approximation to Maximum Weighted Independent Set for Scheduling With Fading Channels
inferredcites →https://doi.org/10.1109/tpds.2012.124openalex-snapshot
Distributed k-Core Decomposition
inferredcites →https://doi.org/10.1109/tpds.2014.2330597openalex-snapshot
BFS-4K: An Efficient Implementation of BFS for Kepler GPU Architectures
inferredcites →https://doi.org/10.1109/tpds.2015.2407900openalex-snapshot
A Survey of Task Allocation and Load Balancing in Distributed Systems
inferredcites →https://doi.org/10.1109/tpds.2015.2485994openalex-snapshot
An Efficient Implementation of the Bellman-Ford Algorithm for Kepler GPU Architectures
inferredcites →https://doi.org/10.1109/tpds.2016.2591038openalex-snapshot
Fast Connected Components Computation in Large Graphs by Vertex Pruning
inferredcites →https://doi.org/10.1109/tpds.2016.2634535openalex-snapshot
Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems
inferredcites →https://doi.org/10.1109/tpds.2017.2672739openalex-snapshot
An Adaptive Parallel Algorithm for Computing Connected Components
inferredcites →https://doi.org/10.1109/tpds.2017.2763951openalex-snapshot
Parallel Algorithm for Incremental Betweenness Centrality on Large Graphs
inferredcites →https://doi.org/10.1109/tpds.2021.3059420openalex-snapshot
A Fault-Tolerant Distributed Framework for Asynchronous Iterative Computations
inferredcites →https://doi.org/10.1109/tpds.2021.3064892openalex-snapshot
Trust: Triangle Counting Reloaded on GPUs
inferredcites →https://doi.org/10.1109/tpds.2021.3090759openalex-snapshot
Efficient Distributed Approaches to Core Maintenance on Large Dynamic Graphs
inferredcites →https://doi.org/10.1109/tpds.2021.3093240openalex-snapshot
A Block-Based Triangle Counting Algorithm on Heterogeneous Environments
inferredcites →https://doi.org/10.1109/tsc.2015.2479225openalex-snapshot
Distributed Maximal Clique Computation and Management
inferredcites →https://doi.org/10.1109/tsmc.2021.3121695openalex-snapshot
Better Approximation for Distributed Weighted Vertex Cover via Game-Theoretic Learning
inferredcites →https://doi.org/10.1109/tvcg.2006.120openalex-snapshot
ASK-GraphView: A Large Scale Graph Visualization System
inferredcites →https://doi.org/10.1137/070710111openalex-snapshot
Power-Law Distributions in Empirical Data
inferredcites →https://doi.org/10.1137/1.9781611975482.49openalex-snapshot
Optimal Distributed Coloring Algorithms for Planar Graphs in the LOCAL model
inferredcites →https://doi.org/10.1137/16m1097808openalex-snapshot
A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths
inferredcites →https://doi.org/10.1137/17m113277xopenalex-snapshot
Near-Optimal Distributed Maximum Flow
inferredcites →https://doi.org/10.1137/19m1286955openalex-snapshot
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
inferredcites →https://doi.org/10.1137/s0097539794261118openalex-snapshot
A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
inferredcites →https://doi.org/10.1145/2213556.2213565openalex-snapshot
Worst-Case Optimal Join Algorithms
inferredcites →https://doi.org/10.1145/2332432.2332504openalex-snapshot
Optimal distributed all pairs shortest paths and applications
inferredcites →https://doi.org/10.1145/2522968.2522979openalex-snapshot
The family of mapreduce and large-scale data processing systems
inferredcites →https://doi.org/10.1145/2588555.2593665openalex-snapshot
Efficient cohesive subgraphs detection in parallel
inferredcites →https://doi.org/10.1145/2684464.2684469openalex-snapshot
Distributed Maximum Matching in Bounded Degree Graphs
inferredcites →https://doi.org/10.1145/2886107.2886110openalex-snapshot
Resilient Distributed Datasets
inferredcites →https://doi.org/10.1145/2897518.2897638openalex-snapshot
A deterministic almost-tight distributed algorithm for approximating single-source shortest paths
inferredcites →https://doi.org/10.1145/3087556.3087571openalex-snapshot
Distributed Detection of Cycles
inferredcites →https://doi.org/10.1145/3104031openalex-snapshot
Foundations of Modern Query Languages for Graph Databases
inferredcites →https://doi.org/10.1145/3293611.3331618openalex-snapshot
Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration
inferredcites →https://doi.org/10.1145/3293883.3295729openalex-snapshot
A round-efficient distributed betweenness centrality algorithm
inferredcites →https://doi.org/10.1145/3308558.3313555openalex-snapshot
Distributed Algorithms for Fully Personalized PageRank on Large Graphs
inferredcites →https://doi.org/10.1145/3318464.3389735openalex-snapshot
Distributed Processing of k Shortest Path Queries over Dynamic Road Networks
inferredcites →https://doi.org/10.1145/3332466.3374519openalex-snapshot
Increasing the parallelism of graph coloring via shortcutting
inferredcites →https://doi.org/10.1145/3387161openalex-snapshot
Distributed Exact Shortest Paths in Sublinear Time
inferredcites →https://doi.org/10.1145/3439724openalex-snapshot
A Survey on Distributed Graph Pattern Matching in Massive Graphs
inferredcites →https://doi.org/10.1145/3446330openalex-snapshot
Near-optimal Distributed Triangle Enumeration via Expander Decompositions
inferredcites →https://doi.org/10.1145/3503221.3508403openalex-snapshot
Scaling graph traversal to 281 trillion edges with 40 million cores
inferredcites →https://doi.org/10.1145/357195.357200openalex-snapshot
A Distributed Algorithm for Minimum-Weight Spanning Trees
inferredcites →https://doi.org/10.1145/3575693.3575743openalex-snapshot
Khuzdul: Efficient and Scalable Distributed Graph Pattern Mining Engine
inferredcites →https://doi.org/10.1145/72551.72552openalex-snapshot
Programming languages for distributed computing systems
inferredcites →https://doi.org/10.1155/2020/4176794openalex-snapshot
Survey of Methodologies, Approaches, and Challenges in Parallel Programming Using High-Performance Computing Systems
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/2794367.2794368openalex-snapshot
Scalable subgraph enumeration in MapReduce
inferredcites →https://doi.org/10.14778/3184470.3184473openalex-snapshot
Distributed evaluation of subgraph queries using worst-case optimal low-memory dataflows
inferredcites →https://doi.org/10.14778/3339490.3339494openalex-snapshot
Distributed subgraph matching on timely dataflow
inferredcites →https://doi.org/10.14778/3529337.3529340openalex-snapshot
Distributed D-core decomposition over large directed graphs
inferredcites →https://doi.org/10.1609/aaai.v33i01.33014496openalex-snapshot
Distributed PageRank Computation: An Improved Theoretical Study
inferredcites →https://doi.org/10.1609/aaai.v37i5.25761openalex-snapshot
Moving-Landmark Assisted Distributed Learning Based Decentralized Cooperative Localization (DL-DCL) with Fault Tolerance
inferredcites →https://doi.org/10.3233/fi-2017-1555openalex-snapshot
The Weighted Matching Approach to Maximum Cardinality Matching
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-032-25029-2_8openalex-snapshot
CEMPAT: A Framework to Identify Colluding Agents in a Graph Network
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-95-7996-9_5openalex-snapshot
Efficient Subgraph Matching with Adaptive Filtering and Core-Set Prioritization
inferred← citeshttps://doi.org/10.1007/s00371-025-03946-1openalex-snapshot
MAS-KCL: knowledge component graph structure learning with large language model-based agentic workflow
inferred← citeshttps://doi.org/10.1007/s00607-025-01417-yopenalex-snapshot
Daas composition: enhancing UAV delivery services via LSTM-based resource prediction and flight patterns mining
inferred← citeshttps://doi.org/10.1007/s00778-025-00951-7openalex-snapshot
On Querying Historical Connectivity in Large-scale Temporal Graphs
inferred← citeshttps://doi.org/10.1016/b978-0-443-45574-2.00005-8openalex-snapshot
Using high-performance libraries
inferred← citeshttps://doi.org/10.1016/j.aei.2025.103649openalex-snapshot
A graph-based systems-of-systems architecture enabling multi-scale Digital Twins for maintaining road infrastructure
inferred← citeshttps://doi.org/10.1016/j.autcon.2026.107246openalex-snapshot
Comprehensive graph-based digital twin for correlation analysis of heterogeneous road infrastructure data
inferred← citeshttps://doi.org/10.1016/j.compbiomed.2025.109874openalex-snapshot
Self-supervised learning for graph-structured data in healthcare applications: A comprehensive review
inferred← citeshttps://doi.org/10.1016/j.cosrev.2026.100981openalex-snapshot
Data analytics algorithms in property graph databases: A survey
inferred← citeshttps://doi.org/10.1016/j.ipm.2025.104343openalex-snapshot
Towards structure-aware data augmentation for high-degree graph neural networks
inferred← citeshttps://doi.org/10.1016/j.jocs.2025.102713openalex-snapshot
Detecting cardinal nodes in unweighted complex networks by examining their trajectories within Krylov subspace and various topological features
inferred← citeshttps://doi.org/10.1016/j.neucom.2026.132828openalex-snapshot
Unpacking distributed machine learning: A unified taxonomy, formal foundations, and the rise of emerging paradigms
inferred← citeshttps://doi.org/10.1016/j.neucom.2026.133016openalex-snapshot
CBERR: Community-based effective resistance graph rewiring
inferred← citeshttps://doi.org/10.1016/j.sysarc.2026.103684openalex-snapshot
A survey on data management for Out-of-Core GNN systems
inferred← citeshttps://doi.org/10.1038/s41598-026-63525-9openalex-snapshot
Temporal-spatial reasoning over hypergraph knowledge structures for multimodal retrieval-augmented generation
inferred← citeshttps://doi.org/10.1049/cit2.70184openalex-snapshot
Vertex Hashing Assignment‐Based Distributed Sampling Algorithm for Large‐Scale Dynamic Graph Stream
inferred← citeshttps://doi.org/10.1109/access.2026.3722554openalex-snapshot
Resource-Aware Scheduling of Graph Partitions for Distributed Graph Computing in Heterogeneous Clusters
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/compsac69091.2026.00170openalex-snapshot
On the Robustness of Traveling Networks: Quantifying Operability, Observability, and Controllability and Designing Self-Healing Mechanisms
inferred← citeshttps://doi.org/10.1109/dcas69364.2026.11544917openalex-snapshot
Vulnerability Analysis of Timing Side-Channels in Multi-Tenant ReRAM Crossbars
inferred← citeshttps://doi.org/10.1109/edis63605.2024.10783167openalex-snapshot
Extending TWJ for Triangles Detection in Large Graphs
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00028openalex-snapshot
HINSCAN: Efficient Structural Graph Clustering Over Heterogeneous Information Networks
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00232openalex-snapshot
Efficient Maximum Balanced k-biplex Search Over Bipartite Graphs
inferred← citeshttps://doi.org/10.1109/jiot.2025.3613449openalex-snapshot
Unveiling Blockchain Transactions Insights: Behavioral Anomaly Detection via Relational Mechanisms
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.2024.3437243openalex-snapshot
Parallel Contraction Hierarchies Construction on Road Networks
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.1109/tkde.2026.3700606openalex-snapshot
Fragmented Graph Pattern Matching on Large Graphs
inferred← citeshttps://doi.org/10.1109/tkde.2026.3717285openalex-snapshot
DSCAN: Structural Clustering on Directed Graphs
inferred← citeshttps://doi.org/10.1145/3722212.3724425openalex-snapshot
A Modular Graph-Native Query Optimization Framework
inferred← citeshttps://doi.org/10.1145/3731545.3744334openalex-snapshot
Rusty-Cracker: A Multi-core Connected Components Library in Rust
inferred← citeshttps://doi.org/10.1145/3746252.3761335openalex-snapshot
CS-Agent: LLM-based Community Search via Dual-agent Collaboration
inferred← citeshttps://doi.org/10.1145/3769795openalex-snapshot
Gem: Scalable Monotonic Graph Processing Beyond Billion-Scale on a Single Machine
inferred← citeshttps://doi.org/10.1145/3769837openalex-snapshot
Triangle Counting in Hypergraph Streams: A Complete and Practical Approach
inferred← citeshttps://doi.org/10.1145/3848520openalex-snapshot
Efficient and Complete Triangle Counting in Hypergraph Streams
inferred← citeshttps://doi.org/10.14778/3704965.3704975openalex-snapshot
Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks
inferred← citeshttps://doi.org/10.14778/3748191.3748199openalex-snapshot
X-Blossom: Massive Parallelization of Graph Maximum Matching
inferred← citeshttps://doi.org/10.32388/v8qvhaopenalex-snapshot
Top Ten Challenges Towards Agentic Neural Graph Databases
inferred← citeshttps://doi.org/10.33411/ijist/1944openalex-snapshot
Optimization of Large-Scale Graph Processing with Advanced Partitioning and Thread Grouping
inferred← citeshttps://doi.org/10.3390/electronics13224425openalex-snapshot
Leveraging Large Language Models for Efficient Alert Aggregation in AIOPs
inferred← citeshttps://doi.org/10.37256/cm.6420256449openalex-snapshot
Independent Resolving Number of Various Graph
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.