Imagen de Portada

Fully Dynamic Matching and Ordered Ruzsa-Szemerédi Graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Behnezhad, Soheil, Ghafari, Alma
Formato:	Preprint
Publicado:	2024
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

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

Stochastic Matching via In-n-Out Local Computation Algorithms
por: Azarmehr, Amir, et al.
Publicado: (2024)

A note on Ordered Ruzsa-Szemerédi graphs
por: Pratt, Kevin
Publicado: (2025)

Lower Bounds for Non-adaptive Local Computation Algorithms
por: Azarmehr, Amir, et al.
Publicado: (2025)

Markov Chains with Rewinding
por: Azarmehr, Amir, et al.
Publicado: (2026)

Fully Dynamic (Δ+1) Coloring Against Adaptive Adversaries
por: Behnezhad, Soheil, et al.
Publicado: (2024)

Correlation Clustering Beyond the Pivot Algorithm
por: Behnezhad, Soheil, et al.
Publicado: (2024)

Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS
por: Azarmehr, Amir, et al.
Publicado: (2024)

Approximating Maximum Matching Requires Almost Quadratic Time
por: Behnezhad, Soheil, et al.
Publicado: (2024)

Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams
por: Assadi, Sepehr, et al.
Publicado: (2024)

Tight Pair Query Lower Bounds for Matching and Earth Mover's Distance
por: Azarmehr, Amir, et al.
Publicado: (2025)

Single-Pass Streaming CSPs via Two-Tier Sampling
por: Azarmehr, Amir, et al.
Publicado: (2026)

Half-Approximating Maximum Dicut in the Streaming Setting
por: Azarmehr, Amir, et al.
Publicado: (2025)

Sublinear Algorithms for TSP via Path Covers
por: Behnezhad, Soheil, et al.
Publicado: (2023)

Vizing's Theorem in Near-Linear Time
por: Assadi, Sepehr, et al.
Publicado: (2024)

Massively Parallel Minimum Spanning Tree in General Metric Spaces
por: Azarmehr, Amir, et al.
Publicado: (2024)

Vizing's Theorem in Deterministic Almost-Linear Time
por: Assadi, Sepehr, et al.
Publicado: (2025)

An algorithmic Polynomial Freiman-Ruzsa theorem
por: Castro-Silva, Davi, et al.
Publicado: (2026)

On Approximate Fully-Dynamic Matching and Online Matrix-Vector Multiplication
por: Liu, Yang P.
Publicado: (2024)

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

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

Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time
por: Goranci, Gramoz, et al.
Publicado: (2025)

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

Fully Dynamic Spectral and Cut Sparsifiers for Directed Graphs
por: Zhao, Yibin
Publicado: (2025)

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

DTC: Real-Time and Accurate Distributed Triangle Counting in Fully Dynamic Graph Streams
por: Xuan, Wei, et al.
Publicado: (2025)

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

Fully Dynamic Euclidean k-Means
por: Bhattacharya, Sayan, et al.
Publicado: (2025)

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)

Fully Dynamic Spectral Sparsification of Hypergraphs
por: Goranci, Gramoz, et al.
Publicado: (2025)

An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs using Fast Matrix Multiplication
por: Assadi, Sepehr, et al.
Publicado: (2025)

Maximum Weight Independent Set in Hereditary Classes of Ordered Graphs
por: Bieliński, Paweł Rafał, et al.
Publicado: (2026)

Algebraic Vertex Ordering of a Sparse Graph for Adjacency Access Locality and Graph Compression
por: Floros, Dimitris, et al.
Publicado: (2024)

Fully Dynamic Shortest Paths in Sparse Digraphs
por: Karczmarz, Adam, et al.
Publicado: (2024)

Simple Algorithms for Fully Dynamic Edge Connectivity
por: Kenneth-Mordoch, Yotam, et al.
Publicado: (2025)

Fully Dynamic Spectral Sparsification for Directed Hypergraphs
por: Forster, Sebastian, et al.
Publicado: (2025)

Fully-Dynamic Submodular Cover with Bounded Recourse
por: Gupta, Anupam, et al.
Publicado: (2020)

Enhanced Graph Pattern Matching
por: Cotumaccio, Nicola
Publicado: (2024)

Greedy Dynamic Matching
por: Arnosti, Nick, et al.
Publicado: (2025)