A characterization of one-sided error testable graph properties in bounded degeneracy graphs
cs.DS
Submitted: 2026-04-06
Updated: 2026-11-02
Terminology
Sources
- A sufficient condition for characterizing the one-sided testable properties of families of graphs in the Random Neighbour Oracle Model
- Every property is testable on a natural class of scale-free multigraphs
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