Deterministic Connectivity Sketches Under Edge Deletions
cs.DS
Submitted: 2026-11-04
Updated: 2026-11-04
Code: https://github.com/Louiealbp/ChromaticInequality
Terminology
Sources
- Turnstile Streaming Algorithms Might (Still) as Well Be Linear Sketches, for Polynomial-Length Streams
- Fault-Tolerant Distance Oracles Below the $n \cdot f$ Barrier
- Reconstruction and subgaussian operators
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- 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