Dynamic Edge Orientation on Low-Arboricity Graphs: Breaking the n Barrier
cs.DS
Submitted: 2026-11-06
Updated: 2026-11-06
Terminology
Sources
- Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation
- Dynamic domination and independence in sparse graphs
- $(1-\epsilon)$-approximate fully dynamic densest subgraph: linear space and faster update time
- Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity
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