Copertina

Deterministic Vertex Connectivity via Common-Neighborhood Clustering and Pseudorandomness

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Jiang, Yonggang, Nalam, Chaitanya, Saranurak, Thatchaphol, Yingchareonthawornchai, Sorrachai
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Directed and Undirected Vertex Connectivity Problems are Equivalent for Dense Graphs
di: Fischer, Olivier, et al.
Pubblicazione: (2025)

Global vs. s-t Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions & Near-Optimal Separations
di: Blikstad, Joakim, et al.
Pubblicazione: (2025)

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

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

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

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

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

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

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

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

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

Hardness Amplification for Dynamic Binary Search Trees
di: Jiang, Shunhua, et al.
Pubblicazione: (2024)

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

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth
di: Koh, Zhuan Khye, et al.
Pubblicazione: (2024)

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

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

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

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

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

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

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

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

A Little Clairvoyance Is All You Need
di: Gupta, Anupam, et al.
Pubblicazione: (2025)

A Simpler Analysis for $\varepsilon$-Clairvoyant Flow Time Scheduling
di: Gupta, Anupam, et al.
Pubblicazione: (2026)

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

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

Parallel Small Vertex Connectivity in Near-Linear Work and Polylogarithmic Depth
di: Jiang, Yonggang, et al.
Pubblicazione: (2025)

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

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

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

Chasing Positive Bodies
di: Bhattacharya, Sayan, et al.
Pubblicazione: (2023)

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

Approximating Small Sparse Cuts
di: Anand, Aditya, et al.
Pubblicazione: (2024)

Deterministic Almost-Linear-Time Gomory-Hu Trees
di: Abboud, Amir, et al.
Pubblicazione: (2025)

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

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

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

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

Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph Problems
di: Bernstein, Aaron, et al.
Pubblicazione: (2025)

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