BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers
Fuente:
arXiv
Saved in:
| Main Authors: | Wheatman, Brian, Dong, Xiaojun, Shen, Zheqi, Dhulipala, Laxman, Łącki, Jakub, Pandey, Prashant, Xu, Helen |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search
by: Gottesbüren, Lars, et al.
Published: (2024)
by: Gottesbüren, Lars, et al.
Published: (2024)
DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering
by: Yu, Shangdi, et al.
Published: (2025)
by: Yu, Shangdi, et al.
Published: (2025)
Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling
by: Dhulipala, Laxman, et al.
Published: (2024)
by: Dhulipala, Laxman, et al.
Published: (2024)
TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs
by: Dhulipala, Laxman, et al.
Published: (2023)
by: Dhulipala, Laxman, et al.
Published: (2023)
Efficient Centroid-Linkage Clustering
by: Bateni, MohammadHossein, et al.
Published: (2024)
by: Bateni, MohammadHossein, et al.
Published: (2024)
Parallel Integer Sort: Theory and Practice
by: Dong, Xiaojun, et al.
Published: (2024)
by: Dong, Xiaojun, et al.
Published: (2024)
Towards Scalable and Practical Batch-Dynamic Connectivity
by: De Man, Quinten, et al.
Published: (2024)
by: De Man, Quinten, et al.
Published: (2024)
Fine-Grained Privacy Guarantees for Coverage Problems
by: Dhulipala, Laxman, et al.
Published: (2024)
by: Dhulipala, Laxman, et al.
Published: (2024)
Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
by: Dhulipala, Laxman, et al.
Published: (2024)
by: Dhulipala, Laxman, et al.
Published: (2024)
Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs
by: Łącki, Jakub, et al.
Published: (2025)
by: Łącki, Jakub, et al.
Published: (2025)
Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
by: De Man, Quinten, et al.
Published: (2026)
by: De Man, Quinten, et al.
Published: (2026)
UFO Trees: Practical and Provably-Efficient Parallel Batch-Dynamic Trees
by: De Man, Quinten, et al.
Published: (2026)
by: De Man, Quinten, et al.
Published: (2026)
It's Hard to HAC with Average Linkage!
by: Bateni, MohammadHossein, et al.
Published: (2024)
by: Bateni, MohammadHossein, et al.
Published: (2024)
Masked Matrix Multiplication for Emergent Sparsity
by: Wheatman, Brian, et al.
Published: (2024)
by: Wheatman, Brian, et al.
Published: (2024)
Parallel Algorithms for Hierarchical Nucleus Decomposition
by: Shi, Jessica, et al.
Published: (2023)
by: Shi, Jessica, et al.
Published: (2023)
CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers
by: Wheatman, Brian, et al.
Published: (2023)
by: Wheatman, Brian, et al.
Published: (2023)
Parallel Hierarchical Agglomerative Clustering in Low Dimensions
by: Bateni, MohammadHossein, et al.
Published: (2025)
by: Bateni, MohammadHossein, et al.
Published: (2025)
Dynamic PageRank: Algorithms and Lower Bounds
by: Jayaram, Rajesh, et al.
Published: (2024)
by: Jayaram, Rajesh, et al.
Published: (2024)
Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism
by: Dhulipala, Laxman, et al.
Published: (2025)
by: Dhulipala, Laxman, et al.
Published: (2025)
Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering
by: De Man, Quinten, et al.
Published: (2025)
by: De Man, Quinten, et al.
Published: (2025)
Chamfer-Linkage for Hierarchical Agglomerative Clustering
by: Gowda, Kishen N, et al.
Published: (2026)
by: Gowda, Kishen N, et al.
Published: (2026)
MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodings
by: Dhulipala, Laxman, et al.
Published: (2024)
by: Dhulipala, Laxman, et al.
Published: (2024)
Massively Parallel Minimum Spanning Tree in General Metric Spaces
by: Azarmehr, Amir, et al.
Published: (2024)
by: Azarmehr, Amir, et al.
Published: (2024)
Near-Optimal Differentially Private k-Core Decomposition
by: Dhulipala, Laxman, et al.
Published: (2023)
by: Dhulipala, Laxman, et al.
Published: (2023)
Parallel Batch-Dynamic Maximal Independent Set
by: Blelloch, Guy, et al.
Published: (2026)
by: Blelloch, Guy, et al.
Published: (2026)
Approximate Nearest Neighbor Search with Window Filters
by: Engels, Joshua, et al.
Published: (2024)
by: Engels, Joshua, et al.
Published: (2024)
Efficiently Constructing Sparse Navigable Graphs
by: Conway, Alex, et al.
Published: (2025)
by: Conway, Alex, et al.
Published: (2025)
How to Train Your Filter: Should You Learn, Stack or Adapt?
by: Sabale, Diandre Miguel, et al.
Published: (2026)
by: Sabale, Diandre Miguel, et al.
Published: (2026)
Testing Graph Properties with the Container Method
by: Blais, Eric, et al.
Published: (2023)
by: Blais, Eric, et al.
Published: (2023)
Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation
by: Blelloch, Guy, et al.
Published: (2026)
by: Blelloch, Guy, et al.
Published: (2026)
New Graph and Hypergraph Container Lemmas with Applications in Property Testing
by: Blais, Eric, et al.
Published: (2024)
by: Blais, Eric, et al.
Published: (2024)
Sparse Graph Reconstruction and Seriation for Large-Scale Image Stacks
by: Yang, Fuming, et al.
Published: (2025)
by: Yang, Fuming, et al.
Published: (2025)
Wooly Graphs : A Mathematical Framework For Knitting
by: Gray, Kathryn, et al.
Published: (2024)
by: Gray, Kathryn, et al.
Published: (2024)
Time To Replace Your Filter: How Maplets Simplify System Design
by: Bender, Michael A., et al.
Published: (2025)
by: Bender, Michael A., et al.
Published: (2025)
A Predictive Framework for Base-n Radix Sort Optimization
by: Pandey, Atharv, et al.
Published: (2025)
by: Pandey, Atharv, et al.
Published: (2025)
A Unified Framework for Hopsets and Spanners
by: Neiman, Ofer, et al.
Published: (2021)
by: Neiman, Ofer, et al.
Published: (2021)
Provably Fast and Space-Efficient Parallel Biconnectivity
by: Dong, Xiaojun, et al.
Published: (2023)
by: Dong, Xiaojun, et al.
Published: (2023)
Finding $b$-colorings Using Feedback Edges
by: Balabán, Jakub
Published: (2025)
by: Balabán, Jakub
Published: (2025)
Tera-Scale Multilevel Graph Partitioning
by: Salwasser, Daniel, et al.
Published: (2024)
by: Salwasser, Daniel, et al.
Published: (2024)
Using Ray-shooting Queries for Sublinear Algorithms for Dominating Sets in RDV Graphs
by: Biedl, Therese, et al.
Published: (2026)
by: Biedl, Therese, et al.
Published: (2026)
Similar Items
-
Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search
by: Gottesbüren, Lars, et al.
Published: (2024) -
DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering
by: Yu, Shangdi, et al.
Published: (2025) -
Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling
by: Dhulipala, Laxman, et al.
Published: (2024) -
TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs
by: Dhulipala, Laxman, et al.
Published: (2023) -
Efficient Centroid-Linkage Clustering
by: Bateni, MohammadHossein, et al.
Published: (2024)