Showing 21–40 of 59 results
/ Date/ Name
May 14, 2018Theoretically Efficient Parallel Graph Algorithms Can Be Fast and ScalableMar 30, 2020Parallel Batch-Dynamic $k$-Clique CountingJun 12, 2019Kaskade: Graph Views for Efficient Graph AnalyticsJun 7, 2021Parallel Batch-Dynamic Algorithms for $k$-Core Decomposition and Related Graph ProblemsNov 22, 2021Theoretically and Practically Efficient Parallel Nucleus DecompositionMay 10, 2022Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph ClusteringMay 18, 2023Faster Parallel Exact Density Peaks ClusteringNov 7, 2023Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive GraphsOct 7, 2017Implicit Decomposition for Write-Efficient Connectivity AlgorithmsNov 20, 2022Differential Privacy from Locally Adjustable Graph Algorithms: $k$-Core Decomposition, Low Out-Degree Ordering, and Densest SubgraphsNov 18, 2024Towards Scalable and Practical Batch-Dynamic ConnectivityMar 28, 2025Reasoning of Large Language Models over Knowledge Graphs with Super-RelationsSep 30, 2025Efficient and Transferable Agentic Knowledge Graph RAG via Reinforcement LearningJul 26, 2025CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor SearchDec 6, 2023PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor SearchJun 8, 2021ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor ChainJun 25, 2025Practical and Accurate Local Edge Differentially Private Graph AlgorithmsNov 15, 2024The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph ClusteringSep 18, 2025Temporal Reasoning with Large Language Models Augmented by Evolving Knowledge GraphsOct 12, 2018Parallelism in Randomized Incremental Algorithms