Cover Image

TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dhulipala, Laxman, Lee, Jason, Łącki, Jakub, Mirrokni, Vahab
Format:	Preprint
Published:	2023
Subjects:	Data Structures and Algorithms Databases Distributed, Parallel, and Cluster Computing Information Retrieval
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Chamfer-Linkage for Hierarchical Agglomerative Clustering
by: Gowda, Kishen N, et al.
Published: (2026)

Parallel Hierarchical Agglomerative Clustering in Low Dimensions
by: Bateni, MohammadHossein, et al.
Published: (2025)

Towards Scalable and Practical Batch-Dynamic Connectivity
by: De Man, Quinten, et al.
Published: (2024)

It's Hard to HAC with Average Linkage!
by: Bateni, MohammadHossein, et al.
Published: (2024)

Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling
by: Dhulipala, Laxman, et al.
Published: (2024)

Parallel Algorithms for Hierarchical Nucleus Decomposition
by: Shi, Jessica, et al.
Published: (2023)

DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering
by: Yu, Shangdi, et al.
Published: (2025)

Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering
by: De Man, Quinten, et al.
Published: (2025)

MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodings
by: Dhulipala, Laxman, et al.
Published: (2024)

Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
by: Dhulipala, Laxman, et al.
Published: (2024)

PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing
by: Rubel, Tobias, et al.
Published: (2026)

CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search
by: Zhang, Ziyu, et al.
Published: (2025)

Parallel Integer Sort: Theory and Practice
by: Dong, Xiaojun, et al.
Published: (2024)

Parallel Batch-Dynamic Maximal Independent Set
by: Blelloch, Guy, et al.
Published: (2026)

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation
by: Blelloch, Guy, et al.
Published: (2026)

Access Control for Information-Theoretically Secure Key-Document Stores
by: Li, Yin, et al.
Published: (2025)

Harmonic Decomposition in Data Sketches
by: Wang, Dingyu
Published: (2024)

JumpBackHash: Say Goodbye to the Modulo Operation to Distribute Keys Uniformly to Buckets
by: Ertl, Otmar
Published: (2024)

Auditable Shared Objects: From Registers to Synchronization Primitives
by: Attiya, Hagit, et al.
Published: (2025)

GPU-RMQ: Accelerating Range Minimum Queries on Modern GPUs
by: Kreis, Lara, et al.
Published: (2026)

On the Effectiveness of Graph Reordering for Accelerating Approximate Nearest Neighbor Search on GPU
by: Oguri, Yutaro, et al.
Published: (2025)

CAGRA: Highly Parallel Graph Construction and Approximate Nearest Neighbor Search for GPUs
by: Ootomo, Hiroyuki, et al.
Published: (2023)

Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search
by: Gottesbüren, Lars, et al.
Published: (2024)

Setchain Algorithms for Blockchain Scalability
by: Karmegam, Arivarasan, et al.
Published: (2025)

Parallel $k$d-tree with Batch Updates
by: Men, Ziyang, et al.
Published: (2024)

Low-Distortion Clustering in Bounded Growth Graphs
by: Chang, Yi-Jun, et al.
Published: (2024)

To Store or Not to Store: a graph theoretical approach for Dataset Versioning
by: Guo, Anxin, et al.
Published: (2024)

Parallel Two-Stage Approach for Joint Symbolic Approximation of Time Series
by: Chen, Xinye
Published: (2023)

FliX: Flipped-Indexing for Scalable GPU Queries and Updates
by: Kharal, Rosina, et al.
Published: (2026)

On Distributed Computation of the Minimum Triangle Edge Transversal
by: Censor-Hillel, Keren, et al.
Published: (2024)

Shared-Memory Hierarchical Process Mapping
by: Schulz, Christian, et al.
Published: (2025)

Towards Optimal Distributed Edge Coloring with Fewer Colors
by: Jakob, Manuel, et al.
Published: (2025)

$k$-Center Clustering in Distributed Models
by: Biabani, Leyla, et al.
Published: (2024)

Parallel Cluster-BFS and Applications to Shortest Paths
by: Wang, Letong, et al.
Published: (2024)

Deterministic Lower Bounds for $k$-Edge Connectivity in the Distributed Sketching Model
by: Robinson, Peter, et al.
Published: (2025)

Selective Population Protocols
by: Gańczorz, Adam, et al.
Published: (2023)

Fully Scalable MPC Algorithms for Clustering in High Dimension
by: Czumaj, Artur, et al.
Published: (2023)

Min-Max Correlation Clustering via Neighborhood Similarity
by: Cao, Nairen, et al.
Published: (2025)

Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights
by: Ashvinkumar, Vikrant, et al.
Published: (2023)

All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For Free
by: Fischer, Orr, et al.
Published: (2025)