Image de couverture de livre

New Graph and Hypergraph Container Lemmas with Applications in Property Testing

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Blais, Eric, Seth, Cameron
Format:	Preprint
Publié:	2024
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

Testing Graph Properties with the Container Method
par: Blais, Eric, et autres
Publié: (2023)

A Tolerant Independent Set Tester
par: Seth, Cameron
Publié: (2025)

Sketching Cuts in Graphs and Hypergraphs
par: Kogan, Dmitry, et autres
Publié: (2014)

Transitivity Preserving Projection in Directed Hypergraphs
par: Parsonage, Eric, et autres
Publié: (2025)

Dynamic Construction of the Lovász Local Lemma
par: Haeupler, Bernhard, et autres
Publié: (2026)

Johnson-Lindenstrauss Lemma Beyond Euclidean Geometry
par: Deng, Chengyuan, et autres
Publié: (2025)

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

Approximating Traveling Salesman Problems Using a Bridge Lemma
par: Böhm, Martin, et autres
Publié: (2024)

Learning Low Degree Hypergraphs
par: Balkanski, Eric, et autres
Publié: (2022)

BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers
par: Wheatman, Brian, et autres
Publié: (2024)

Hyper-distance Oracles in Hypergraphs
par: Preti, Giulia, et autres
Publié: (2023)

A simple algorithm for Combinatorial n-fold ILPs using the Steinitz Lemma
par: Gupta, Sushmita, et autres
Publié: (2025)

New Algorithms for Incremental Minimum Spanning Trees and Temporal Graph Applications
par: Ding, Xiangyun, et autres
Publié: (2025)

Property Testing of Computational Networks
par: Czumaj, Artur, et autres
Publié: (2025)

Notes on the Linear Algebraic View of Regularity Lemmas
par: Bodwin, Greg, et autres
Publié: (2025)

Hypergraph Unreliability in Quasi-Polynomial Time
par: Cen, Ruoxu, et autres
Publié: (2024)

Engineering Hypergraph $b$-Matching Algorithms
par: Großmann, Ernestine, et autres
Publié: (2024)

Mimicking Networks for Constrained Multicuts in Hypergraphs
par: Cho, Kyungjin, et autres
Publié: (2024)

Compressing Hypergraphs using Suffix Sorting
par: Adler, Enno, et autres
Publié: (2025)

Semi-Streaming Algorithms for Hypergraph Matching
par: Reinstädtler, Henrik, et autres
Publié: (2025)

Efficient Parallel Algorithms for Hypergraph Matching
par: Reinstädtler, Henrik, et autres
Publié: (2026)

Fully Dynamic Spectral Sparsification of Hypergraphs
par: Goranci, Gramoz, et autres
Publié: (2025)

Almost Tight Bounds for Online Hypergraph Matching
par: Tröbst, Thorben, et autres
Publié: (2024)

A Refined Graph Container Lemma and Applications to the Hard‐Core Model on Bipartite Expanders
par: Matthew Jenssen, et autres
Publié: (2026)

Overlapping and Robust Edge-Colored Clustering in Hypergraphs
par: Crane, Alex, et autres
Publié: (2023)

Sublinear Edge Fault Tolerant Spanners for Hypergraphs
par: He, Jialin, et autres
Publié: (2025)

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

Improved Certificates for Independence Number in Semirandom Hypergraphs
par: Kothari, Pravesh, et autres
Publié: (2026)

Near-Optimal Minimum Cuts in Hypergraphs at Scale
par: Chhabra, Adil, et autres
Publié: (2025)

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

Online versus Offline Adversaries in Property Testing
par: Kelman, Esty, et autres
Publié: (2024)

A new notion of commutativity for the algorithmic Lovász Local Lemma
par: Harris, David G., et autres
Publié: (2020)

A Sampling Lovász Local Lemma for Large Domain Sizes
par: Wang, Chunyang, et autres
Publié: (2023)

Solving Hypergraph Laplacian Systems in Almost-Linear Time
par: Yoshida, Yuichi
Publié: (2026)

Most Juntas Saturate the Hardcore Lemma
par: Kumar, Vinayak M.
Publié: (2025)

Polynomial Property Testing
par: Gishboliner, Lior, et autres
Publié: (2025)

Near-optimal Size Linear Sketches for Hypergraph Cut Sparsifiers
par: Khanna, Sanjeev, et autres
Publié: (2024)

Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs
par: Khanna, Sanjeev, et autres
Publié: (2024)

FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs
par: Lanzinger, Matthias, et autres
Publié: (2023)

Data Reductions for the Strong Maximum Independent Set Problem in Hypergraphs
par: Großmann, Ernestine, et autres
Publié: (2026)