Near-Optimal Linear Sketches and Fully-Dynamic Algorithms for Hypergraph Spectral Sparsification
Open Access
- 15 June 2025
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1190-1200
Abstract
No abstract availableAll Related Versions
Funding Information
- National Science Foundation (2008305, 2402284, 2152413)
This publication has 31 references indexed in Scilit:
- Near-Optimal Size Linear Sketches for Hypergraph Cut Sparsifiers2024
- Online Algorithms for Spectral Hypergraph Sparsification2024
- Hypergraph 1-Spectral Clustering with General Submodular Weights2022
- On Weighted Graph Sparsification by Linear Sketching2022
- Spectral Hypergraph Sparsifiers of Nearly Linear Size2022
- Near-linear Size Hypergraph Cut Sparsifiers2020
- New Notions and Constructions of Sparsification for Graphs and Hypergraphs2019
- Re-Revisiting Learning on Hypergraphs: Confidence Interval, Subgradient Method, and Extension to MulticlassIEEE Transactions on Knowledge and Data Engineering, 2018
- On Fully Dynamic Graph Sparsifiers2016
- Single Pass Spectral Sparsification in Dynamic Streams2014