Image de couverture de livre

Fully Dynamic Spectral Sparsification of Hypergraphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Goranci, Gramoz, Momeni, Ali
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Fully Dynamic Spectral Sparsification for Directed Hypergraphs
par: Forster, Sebastian, et autres
Publié: (2025)

Fully Dynamic Algorithms for Transitive Reduction
par: Goranci, Gramoz, et autres
Publié: (2025)

Dynamic Hierarchical $j$-Tree Decomposition and Its Applications
par: Goranci, Gramoz, et autres
Publié: (2026)

Fully Dynamic Algorithms for Chamfer Distance
par: Goranci, Gramoz, et autres
Publié: (2025)

Fully Dynamic Exact Edge Connectivity in Sublinear Time
par: Goranci, Gramoz, et autres
Publié: (2023)

Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time
par: Goranci, Gramoz, et autres
Publié: (2025)

Near-optimal Linear Sketches and Fully-Dynamic Algorithms for Hypergraph Spectral Sparsification
par: Khanna, Sanjeev, et autres
Publié: (2025)

Dynamic algorithms for k-center on graphs
par: Cruciani, Emilio, et autres
Publié: (2023)

Tree Embedding in High Dimensions: Dynamic and Massively Parallel
par: Goranci, Gramoz, et autres
Publié: (2025)

Faster Graph Embeddings via Coarsening
par: Fahrbach, Matthew, et autres
Publié: (2020)

Cut Sparsification and Succinct Representation of Submodular Hypergraphs
par: Kenneth, Yotam, et autres
Publié: (2023)

Quantum Speedup for Hypergraph Sparsification
par: Liu, Chenghua, et autres
Publié: (2025)

Near-optimal Hypergraph Sparsification in Insertion-only and Bounded-deletion Streams
par: Khanna, Sanjeev, et autres
Publié: (2025)

A Theory of Spectral CSP Sparsification
par: Khanna, Sanjeev, et autres
Publié: (2025)

Nearly Space-Optimal Graph and Hypergraph Sparsification in Insertion-Only Data Streams
par: Cohen-Addad, Vincent, et autres
Publié: (2025)

Fast and Faithful Edge Bundling using Spectral Sparsification
par: Jiang, Xingjue, et autres
Publié: (2026)

Spectral Sparsification by Deterministic Discrepancy Walk
par: Lau, Lap Chi, et autres
Publié: (2024)

Bootstrapping Dynamic APSP via Sparsification
par: Kyng, Rasmus, et autres
Publié: (2024)

Fully Dynamic Spectral and Cut Sparsifiers for Directed Graphs
par: Zhao, Yibin
Publié: (2025)

Faster Spectral Density Estimation and Sparsification in the Nuclear Norm
par: Jin, Yujia, et autres
Publié: (2024)

Structure-Aware Spectral Sparsification via Uniform Edge Sampling
par: He, Kaiwen, et autres
Publié: (2025)

Max-Distance Sparsification for Diversification and Clustering
par: Kumabe, Soh
Publié: (2024)

Balancing Weights, Directed Sparsification, and Augmenting Paths
par: Li, Jason
Publié: (2026)

Efficient Algorithms and New Characterizations for CSP Sparsification
par: Khanna, Sanjeev, et autres
Publié: (2024)

Eulerian Graph Sparsification by Effective Resistance Decomposition
par: Jambulapati, Arun, et autres
Publié: (2024)

Linear-Time Multilevel Graph Partitioning via Edge Sparsification
par: Gottesbüren, Lars, et autres
Publié: (2025)

Fully Dynamic Euclidean k-Means
par: Bhattacharya, Sayan, et autres
Publié: (2025)

Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut
par: Cheng, Yu, et autres
Publié: (2024)

Simple Algorithms for Fully Dynamic Edge Connectivity
par: Kenneth-Mordoch, Yotam, et autres
Publié: (2025)

Fully Dynamic Shortest Paths in Sparse Digraphs
par: Karczmarz, Adam, et autres
Publié: (2024)

Fully-Dynamic Submodular Cover with Bounded Recourse
par: Gupta, Anupam, et autres
Publié: (2020)

Additive Sparsification of CSPs
par: Pelleg, Eden, et autres
Publié: (2021)

Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms
par: Assadi, Sepehr, et autres
Publié: (2025)

inGRASS: Incremental Graph Spectral Sparsification via Low-Resistance-Diameter Decomposition
par: Aghdaei, Ali, et autres
Publié: (2024)

Fully Dynamic Algorithms for Coloring Triangle-Free Graphs
par: Assadi, Sepehr, et autres
Publié: (2026)

Fully Dynamic Matching and Ordered Ruzsa-Szemerédi Graphs
par: Behnezhad, Soheil, et autres
Publié: (2024)

Fully Dynamic Strongly Connected Components in Planar Digraphs
par: Karczmarz, Adam, et autres
Publié: (2024)

Engineering Fully Dynamic Exact $Δ$-Orientation Algorithms
par: Großmann, Ernestine, et autres
Publié: (2024)

Compressing Dynamic Fully Indexable Dictionaries in Word-RAM
par: Domingues, Gabriel Marques
Publié: (2026)

Simple Sublinear Algorithms for $(Δ+1)$ Vertex Coloring via Asymmetric Palette Sparsification
par: Assadi, Sepehr, et autres
Publié: (2025)