Imagen de Portada

Simple Algorithms for Fully Dynamic Edge Connectivity

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kenneth-Mordoch, Yotam, Krauthgamer, Robert
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

Cut-Query Algorithms with Few Rounds
por: Kenneth-Mordoch, Yotam, et al.
Publicado: (2025)

Faster All-Pairs Minimum Cut: Bypassing Exact Max-Flow
por: Kenneth-Mordoch, Yotam, et al.
Publicado: (2025)

All-Pairs Minimum Cut using $\tilde{O}(n^{7/4})$ Cut Queries
por: Kenneth-Mordoch, Yotam, et al.
Publicado: (2025)

Faster Pseudo-Deterministic Minimum Cut
por: Kenneth-Mordoch, Yotam
Publicado: (2026)

Cut Sparsification and Succinct Representation of Submodular Hypergraphs
por: Kenneth, Yotam, et al.
Publicado: (2023)

On the Adversarial Robustness of Online Importance Sampling
por: Kenneth-Mordoch, Yotam, et al.
Publicado: (2025)

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

Stable coresets: Unleashing the power of uniform sampling
por: Carmel, Amir, et al.
Publicado: (2025)

Sketching Cuts in Graphs and Hypergraphs
por: Kogan, Dmitry, et al.
Publicado: (2014)

Streaming Algorithms for Geometric Steiner Forest
por: Czumaj, Artur, et al.
Publicado: (2020)

Fully Scalable MPC Algorithms for Clustering in High Dimension
por: Czumaj, Artur, et al.
Publicado: (2023)

On Solving Linear Systems in Sublinear Time
por: Andoni, Alexandr, et al.
Publicado: (2018)

Fully Dynamic Graph Algorithms with Edge Differential Privacy
por: Raskhodnikova, Sofya, et al.
Publicado: (2024)

Fully Dynamic Strongly Connected Components in Planar Digraphs
por: Karczmarz, Adam, et al.
Publicado: (2024)

Fully Dynamic Algorithms for Chamfer Distance
por: Goranci, Gramoz, et al.
Publicado: (2025)

Fully Dynamic Algorithms for Transitive Reduction
por: Goranci, Gramoz, et al.
Publicado: (2025)

Moderate Dimension Reduction for $k$-Center Clustering
por: Jiang, Shaofeng H. -C., et al.
Publicado: (2023)

Better Decremental and Fully Dynamic Sensitivity Oracles for Subgraph Connectivity
por: Long, Yaowei, et al.
Publicado: (2024)

On $b$-Matching and Fully-Dynamic Maximum $k$-Edge Coloring
por: El-Hayek, Antoine, et al.
Publicado: (2023)

An Algorithmic Bridge Between Hamming and Levenshtein Distances
por: Goldenberg, Elazar, et al.
Publicado: (2022)

Fully Dynamic Algorithms for Coloring Triangle-Free Graphs
por: Assadi, Sepehr, et al.
Publicado: (2026)

Engineering Fully Dynamic Exact $Δ$-Orientation Algorithms
por: Großmann, Ernestine, et al.
Publicado: (2024)

Improved Bounds with a Simple Algorithm for Edge Estimation for Graphs of Unknown Size
por: Chanda, Debarshi
Publicado: (2025)

A Simple Algorithm for Dynamic Carpooling with Recourse
por: Efron, Yuval, et al.
Publicado: (2024)

Coresets for Kernel Clustering
por: Jiang, Shaofeng H. -C., et al.
Publicado: (2021)

Near-Optimal Dimension Reduction for Facility Location
por: Huang, Lingxiao, et al.
Publicado: (2024)

A Faster Deterministic Algorithm for Fully Dynamic Maximal Matching
por: Chuzhoy, Julia, et al.
Publicado: (2026)

Fast Nearest Neighbor Search for $\ell_p$ Metrics
por: Krauthgamer, Robert, et al.
Publicado: (2026)

An Approximation Algorithm for 2-Vertex-Connectivity via Cycle-Restricted 2-Edge-Covers
por: Kobayashi, Yusuke, et al.
Publicado: (2026)

Dimension Reduction for Clustering: The Curious Case of Discrete Centers
por: Jiang, Shaofeng H. -C., et al.
Publicado: (2025)

Near-optimal Linear Sketches and Fully-Dynamic Algorithms for Hypergraph Spectral Sparsification
por: Khanna, Sanjeev, et al.
Publicado: (2025)

Fully Dynamic Algorithms for Graph Spanners via Low-Diameter Router Decomposition
por: Chuzhoy, Julia, et al.
Publicado: (2026)

Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time
por: Georgiadis, Loukas, et al.
Publicado: (2026)

An Approximation Algorithm for $K$-best Enumeration of Minimal Connected Edge Dominating Sets with Cardinality Constraints
por: Kurita, Kazuhiro, et al.
Publicado: (2022)

Fully Dynamic Connectivity in $O(\log n(\log\log n)^2)$ Amortized Expected Time
por: Huang, Shang-En, et al.
Publicado: (2016)

A Simple Algorithm for Near-Vizing Edge-Coloring in Near-Linear Time
por: Dhawan, Abhishek
Publicado: (2024)

Clustering Permutations: New Techniques with Streaming Applications
por: Chakraborty, Diptarka, et al.
Publicado: (2022)

On Sketching Quadratic Forms
por: Andoni, Alexandr, et al.
Publicado: (2015)

Simple and Faster Algorithms for Knapsack
por: He, Qizheng, et al.
Publicado: (2023)

9/7-Approximation for Two-Edge-Connectivity and Two-Vertex-Connectivity
por: Çivril, Ali
Publicado: (2024)