Testing for a Large Induced Expander: Sublinear Algorithms and Query Lower Bounds
cs.DS
Submitted: 2026-11-03
Updated: 2026-11-03
Terminology
Sources
- A new proof of Friedman's second eigenvalue Theorem and its extension to random lifts
- Testing Graph Clusterability: Algorithms and Lower Bounds
- Testing Bipartiteness in Logarithmic Rounds
- Finding large expanders in graphs: from topological minors to induced subgraphs
- Tolerant Testing for Unique Games
Related papers
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time
- Fast Odd-Permutation Sums in Characteristic Two and Shortest Even Directed Cycles