Imagen de Portada

Dynamic Approximate Maximum Matching in the Distributed Vertex Partition Model

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Robinson, Peter, Zhu, Xianbin
Formato:	Preprint
Publicado:	2025
Materias:	Distributed, Parallel, and Cluster Computing Data Structures and Algorithms 68W15
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Dynamic Maximal Matching in Clique Networks
por: Li, Minming, et al.
Publicado: (2024)

Perfect Matching with Few Link Activations
por: Mirault, Hugo, et al.
Publicado: (2025)

A Simple $(1-ε)$-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching
por: Assadi, Sepehr
Publicado: (2023)

The Local Information Cost of Distributed Graph Spanners
por: Robinson, Peter
Publicado: (2020)

Improved Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs
por: Gil, Yuval
Publicado: (2024)

Deterministic Lower Bounds for $k$-Edge Connectivity in the Distributed Sketching Model
por: Robinson, Peter, et al.
Publicado: (2025)

Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning
por: Sanders, Peter, et al.
Publicado: (2024)

Sublogarithmic Distributed Vertex Coloring with Optimal Number of Colors
por: Flin, Maxime, et al.
Publicado: (2026)

Distributed Maximum Flow in Planar Graphs
por: Abd-Elhaleem, Yaseen, et al.
Publicado: (2024)

A Nearly Linear-Time Distributed Algorithm for Maximum Cardinality Matching
por: Izumi, Taisuke, et al.
Publicado: (2023)

Tight Bounds on the Message Complexity of Distributed Tree Verification
por: Kutten, Shay, et al.
Publicado: (2024)

Distributed Reductions for the Maximum Weight Independent Set Problem
por: Borowitz, Jannick, et al.
Publicado: (2025)

Parallel Batch Dynamic Vertex Coloring in $O(\log Δ)$ Amortized Update Time
por: Hutton, Chase, et al.
Publicado: (2025)

What Can We Compute in a Single Round of the Congested Clique?
por: Robinson, Peter
Publicado: (2022)

Local Density and its Distributed Approximation
por: Christiansen, Aleksander Bjørn, et al.
Publicado: (2024)

Parallel Dynamic Maximal Matching
por: Ghaffari, Mohsen, et al.
Publicado: (2024)

Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs
por: Bonamy, Marthe, et al.
Publicado: (2025)

Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching
por: Khoury, Seri, et al.
Publicado: (2025)

A Fast-Converging Decentralized Approach to the Weighted Minimum Vertex Cover Problem
por: Mordacchini, Matteo, et al.
Publicado: (2025)

Parallel Batch-Dynamic Maximal Matching with Constant Work per Update
por: Blelloch, Guy E., et al.
Publicado: (2025)

Population Protocols Revisited: Parity and Beyond
por: Gąsieniec, Leszek, et al.
Publicado: (2025)

A $(3+\varepsilon)$-Approximate Correlation Clustering Algorithm in Dynamic Streams
por: Cambus, Mélanie, et al.
Publicado: (2022)

Weighted Matching in a Poly-Streaming Model
por: Ullah, Ahammed, et al.
Publicado: (2025)

Massively Parallel Maximum Coverage Revisited
por: Bui, Thai, et al.
Publicado: (2024)

OPTIMUM-DERAM: Highly Consistent, Scalable, and Secure Multi-Object Memory using RLNC
por: Nicolaou, Nicolas, et al.
Publicado: (2026)

Context Adaptive Cooperation
por: Albouy, Timothé, et al.
Publicado: (2023)

Time-Optimal and Energy-Efficient Deterministic Consensus
por: Meir, Shachar, et al.
Publicado: (2025)

Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model
por: Manoharan, Vignesh, et al.
Publicado: (2023)

Message Optimality and Message-Time Trade-offs for APSP and Beyond
por: Dufoulon, Fabien, et al.
Publicado: (2025)

$k$-Center Clustering in Distributed Models
por: Biabani, Leyla, et al.
Publicado: (2024)

The Quantum Message Complexity of Distributed Wake-Up with Advice
por: Robinson, Peter, et al.
Publicado: (2026)

On the Randomized Locality of Matching Problems in Regular Graphs
por: Khoury, Seri, et al.
Publicado: (2025)

Massively Parallel Algorithms for Approximate Shortest Paths
por: Dory, Michal, et al.
Publicado: (2024)

When MIS and Maximal Matching are Easy in the Congested Clique
por: Censor-Hillel, Keren, et al.
Publicado: (2025)

Improved All-Pairs Approximate Shortest Paths in Congested Clique
por: Bui, Hong Duc, et al.
Publicado: (2024)

Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model
por: Chang, Yi-Jun, et al.
Publicado: (2023)

Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling
por: Dhulipala, Laxman, et al.
Publicado: (2024)

Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs
por: Boneh, Itai, et al.
Publicado: (2025)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
por: Ghaffari, Mohsen, et al.
Publicado: (2025)

Faster Multi-Source Reachability and Approximate Distances via Shortcuts, Hopsets and Matrix Multiplication
por: Elkin, Michael, et al.
Publicado: (2025)