:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Yang, Fuming, Meirovitch, Yaron, Lichtman, Jeff W.
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2509.23084
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Sum-of-Squares Lower Bounds for Independent Set in Ultra-Sparse Random Graphs
by: Kothari, Pravesh, et al.
Published: (2024)

Distance Reconstruction of Sparse Random Graphs
by: Bastide, Paul
Published: (2024)

Budgeted Broadcast: An Activity-Dependent Pruning Rule for Neural Network Efficiency
by: Meirovitch, Yaron, et al.
Published: (2025)

Listing 6-Cycles in Sparse Graphs
by: Williams, Virginia Vassilevska, et al.
Published: (2024)

Local Max-Cut on Sparse Graphs
by: Schwartzman, Gregory
Published: (2023)

Efficient Trace Frequency Queries in Sparse Graphs
by: Awofeso, Christine, et al.
Published: (2025)

BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers
by: Wheatman, Brian, et al.
Published: (2024)

CuckooGraph: A Scalable and Space-Time Efficient Data Structure for Large-Scale Dynamic Graphs
by: Fan, Zhuochen, et al.
Published: (2024)

Graph Reconstruction via MIS Queries
by: Konrad, Christian, et al.
Published: (2024)

Algebraic Vertex Ordering of a Sparse Graph for Adjacency Access Locality and Graph Compression
by: Floros, Dimitris, et al.
Published: (2024)

Maximization of Approximately Submodular Functions
by: Horel, Thibaut, et al.
Published: (2024)

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness
by: Khanna, Sanjeev, et al.
Published: (2025)

Optimal Approximations for the Requirement Cut Problem on Sparse Graph Classes
by: Mallek, Nadym, et al.
Published: (2025)

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs
by: Łącki, Jakub, et al.
Published: (2025)

Graph Reconstruction with a Connected Components Oracle
by: Harviainen, Juha, et al.
Published: (2025)

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing
by: Eppstein, David, et al.
Published: (2025)

Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach
by: Yang, Yichun, et al.
Published: (2024)

Streaming Complexity Separations for Dense and Sparse Graphs
by: Liu, Yang P., et al.
Published: (2026)

Tera-Scale Multilevel Graph Partitioning
by: Salwasser, Daniel, et al.
Published: (2024)

On Minimizing Wiggle in Stacked Area Charts
by: Dobler, Alexander, et al.
Published: (2025)

When is String Reconstruction using de Bruijn Graphs Hard?
by: Bals, Ben, et al.
Published: (2025)

Routing on Sparse Graphs with Non-metric Costs for the Prize-collecting Travelling Salesperson Problem
by: O'Hara, Patrick, et al.
Published: (2024)

Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
by: De Man, Quinten, et al.
Published: (2026)

Sparse Neighborhood Graph-Based Approximate Nearest Neighbor Search Revisited: Theoretical Analysis and Optimization
by: Ma, Xinran, et al.
Published: (2025)

Towards 1000-fold Electron Microscopy Image Compression for Connectomics via VQ-VAE with Transformer Prior
by: Yang, Fuming, et al.
Published: (2025)

Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More
by: Jin, Ce, et al.
Published: (2024)

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

Improved parallel derandomization via finite automata with applications
by: Giliberti, Jeff, et al.
Published: (2024)

On the Approximability of Max-Cut on 3-Colorable Graphs and Graphs with Large Independent Sets
by: Ghoshal, Suprovat, et al.
Published: (2026)

Online Coloring for Graphs of Large Odd Girth
by: Yoneda, Hirotaka, et al.
Published: (2026)

Sparse Outerstring Graphs Have Logarithmic Treewidth
by: An, Shinwoo, et al.
Published: (2024)

How to Train Your Filter: Should You Learn, Stack or Adapt?
by: Sabale, Diandre Miguel, et al.
Published: (2026)

Approximating Small Sparse Cuts
by: Anand, Aditya, et al.
Published: (2024)

Scalable Similarity Search over Large Attributed Bipartite Graphs
by: Ou, Xi, et al.
Published: (2025)

Sparse Random Matrices for Dimensionality Reduction
by: Mackenzie, Pierre
Published: (2025)

Revisiting the Sparse Matrix Compression Problem
by: Jugé, Vincent, et al.
Published: (2026)

Testing Sparse Functions over the Reals
by: Arora, Vipul, et al.
Published: (2026)

An Improved Algorithm for Sparse Instances of SAT
by: Jain, Sanjay, et al.
Published: (2024)

Accurate and Fast Approximate Graph Pattern Mining at Scale
by: Arpaci-Dusseau, Anna, et al.
Published: (2024)

Pattern-Sparse Tree Decompositions in $H$-Minor-Free Graphs
by: Marx, Dániel, et al.
Published: (2026)