Imagen de Portada

Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph Problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bernstein, Aaron, Bhattacharya, Sayan, Fischer, Nick, Kiss, Peter, Saranurak, Thatchaphol
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Deterministic Dynamic Maximal Matching in Sublinear Update Time
por: Bernstein, Aaron, et al.
Publicado: (2025)

Dynamic $(1+ε)$-Approximate Matching Size in Truly Sublinear Update Time
por: Bhattacharya, Sayan, et al.
Publicado: (2023)

Chasing Positive Bodies
por: Bhattacharya, Sayan, et al.
Publicado: (2023)

Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs
por: Bernstein, Aaron, et al.
Publicado: (2025)

Maximum Flow by Augmenting Paths in $n^{2+o(1)}$ Time
por: Bernstein, Aaron, et al.
Publicado: (2024)

Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth
por: Ashvinkumar, Vikrant, et al.
Publicado: (2026)

All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs
por: Anand, Aditya, et al.
Publicado: (2025)

Decremental $(1+ε)$-Approximate Maximum Eigenvector: Dynamic Power Method
por: Adil, Deeksha, et al.
Publicado: (2024)

Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs
por: Bhattacharya, Sayan, et al.
Publicado: (2023)

DAG Projections: Reducing Distance and Flow Problems to DAGs
por: Haeupler, Bernhard, et al.
Publicado: (2026)

Reducing Shortcut and Hopset Constructions to Shallow Graphs
por: Haeupler, Bernhard, et al.
Publicado: (2025)

Local Sherman's Algorithm for Multi-commodity Flow
por: Li, Jason, et al.
Publicado: (2025)

Dynamic Deterministic Constant-Approximate Distance Oracles with $n^ε$ Worst-Case Update Time
por: Haeupler, Bernhard, et al.
Publicado: (2024)

Deterministic Negative-Weight Shortest Paths in Nearly Linear Time via Path Covers
por: Haeupler, Bernhard, et al.
Publicado: (2025)

Near-Optimal Fault-Tolerant Strong Connectivity Preservers
por: Hoppenworth, Gary, et al.
Publicado: (2025)

Expander Decomposition with Almost Optimal Overhead
por: Bansal, Nikhil, et al.
Publicado: (2026)

Connectivity Labeling Schemes for Edge and Vertex Faults via Expander Hierarchies
por: Long, Yaowei, et al.
Publicado: (2024)

Deterministic Edge Connectivity and Max Flow using Subquadratic Cut Queries
por: Anand, Aditya, et al.
Publicado: (2024)

Expander Pruning with Polylogarithmic Worst-Case Recourse and Update Time
por: Meierhans, Simon, et al.
Publicado: (2025)

Cactus Representation of Minimum Cuts: Derandomize and Speed up
por: He, Zhongtian, et al.
Publicado: (2024)

Space Complexity of Vertex Connectivity Oracles
por: Pettie, Seth, et al.
Publicado: (2022)

Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts
por: Haeupler, Bernhard, et al.
Publicado: (2025)

Deterministic Vertex Connectivity via Common-Neighborhood Clustering and Pseudorandomness
por: Jiang, Yonggang, et al.
Publicado: (2025)

Approximating Directed Minimum Cut and Arborescence Packing via Directed Expander Hierarchies
por: Jiang, Yonggang, et al.
Publicado: (2025)

A Constant-Approximation Distance Labeling Scheme under Polynomially Many Edge Failures
por: Haeupler, Bernhard, et al.
Publicado: (2026)

Approximating Small Sparse Cuts
por: Anand, Aditya, et al.
Publicado: (2024)

Finding Most Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time
por: Hua, Kevin, et al.
Publicado: (2024)

Disjoint Paths in Expanders in Deterministic Almost-Linear Time via Hypergraph Perfect Matching
por: Bucić, Matija, et al.
Publicado: (2025)

Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal
por: Chen, Daoyuan, et al.
Publicado: (2024)

Fully Dynamic Exact Edge Connectivity in Sublinear Time
por: Goranci, Gramoz, et al.
Publicado: (2023)

Parallel $(1+ε)$-Approximate Multi-Commodity Mincost Flow in Almost Optimal Depth and Work
por: Haeupler, Bernhard, et al.
Publicado: (2025)

Connectivity Oracle Under Vertex Failures by Shortcutting Unbreakable Decomposition
por: Li, Xizhe, et al.
Publicado: (2026)

Unbreakable Decomposition in Close-to-Linear Time
por: Anand, Aditya, et al.
Publicado: (2024)

Low-Step Multi-Commodity Flow Emulators
por: Haeupler, Bernhard, et al.
Publicado: (2024)

Reviving Thorup's Shortcut Conjecture
por: Bernstein, Aaron, et al.
Publicado: (2025)

From Unweighted to Weighted Dynamic Matching in Non-Bipartite Graphs: A Low-Loss Reduction
por: Bernstein, Aaron, et al.
Publicado: (2025)

Separating Oblivious and Adaptive Differential Privacy under Continual Observation
por: Bun, Mark, et al.
Publicado: (2026)

Fully Dynamic Set Cover: Worst-Case Recourse and Update Time
por: Bhattacharya, Sayan, et al.
Publicado: (2025)

Fully Dynamic $k$-Median with Near-Optimal Update Time and Recourse
por: Bhattacharya, Sayan, et al.
Publicado: (2024)

Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemeredi Graphs
por: Assadi, Sepehr, et al.
Publicado: (2024)