Image de couverture de livre

Dynamic Approximate Maximum Matching in the Distributed Vertex Partition Model

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Robinson, Peter, Zhu, Xianbin
Format:	Preprint
Publié:	2025
Sujets:	Distributed, Parallel, and Cluster Computing Data Structures and Algorithms 68W15
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Dynamic Maximal Matching in Clique Networks
par: Li, Minming, et autres
Publié: (2024)

Perfect Matching with Few Link Activations
par: Mirault, Hugo, et autres
Publié: (2025)

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

The Local Information Cost of Distributed Graph Spanners
par: Robinson, Peter
Publié: (2020)

Improved Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs
par: Gil, Yuval
Publié: (2024)

Deterministic Lower Bounds for $k$-Edge Connectivity in the Distributed Sketching Model
par: Robinson, Peter, et autres
Publié: (2025)

Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning
par: Sanders, Peter, et autres
Publié: (2024)

Sublogarithmic Distributed Vertex Coloring with Optimal Number of Colors
par: Flin, Maxime, et autres
Publié: (2026)

Distributed Maximum Flow in Planar Graphs
par: Abd-Elhaleem, Yaseen, et autres
Publié: (2024)

A Nearly Linear-Time Distributed Algorithm for Maximum Cardinality Matching
par: Izumi, Taisuke, et autres
Publié: (2023)

Tight Bounds on the Message Complexity of Distributed Tree Verification
par: Kutten, Shay, et autres
Publié: (2024)

Distributed Reductions for the Maximum Weight Independent Set Problem
par: Borowitz, Jannick, et autres
Publié: (2025)

Parallel Batch Dynamic Vertex Coloring in $O(\log Δ)$ Amortized Update Time
par: Hutton, Chase, et autres
Publié: (2025)

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

Local Density and its Distributed Approximation
par: Christiansen, Aleksander Bjørn, et autres
Publié: (2024)

Parallel Dynamic Maximal Matching
par: Ghaffari, Mohsen, et autres
Publié: (2024)

Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs
par: Bonamy, Marthe, et autres
Publié: (2025)

Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching
par: Khoury, Seri, et autres
Publié: (2025)

A Fast-Converging Decentralized Approach to the Weighted Minimum Vertex Cover Problem
par: Mordacchini, Matteo, et autres
Publié: (2025)

Parallel Batch-Dynamic Maximal Matching with Constant Work per Update
par: Blelloch, Guy E., et autres
Publié: (2025)

Population Protocols Revisited: Parity and Beyond
par: Gąsieniec, Leszek, et autres
Publié: (2025)

A $(3+\varepsilon)$-Approximate Correlation Clustering Algorithm in Dynamic Streams
par: Cambus, Mélanie, et autres
Publié: (2022)

Weighted Matching in a Poly-Streaming Model
par: Ullah, Ahammed, et autres
Publié: (2025)

Massively Parallel Maximum Coverage Revisited
par: Bui, Thai, et autres
Publié: (2024)

OPTIMUM-DERAM: Highly Consistent, Scalable, and Secure Multi-Object Memory using RLNC
par: Nicolaou, Nicolas, et autres
Publié: (2026)

Context Adaptive Cooperation
par: Albouy, Timothé, et autres
Publié: (2023)

Time-Optimal and Energy-Efficient Deterministic Consensus
par: Meir, Shachar, et autres
Publié: (2025)

Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model
par: Manoharan, Vignesh, et autres
Publié: (2023)

Message Optimality and Message-Time Trade-offs for APSP and Beyond
par: Dufoulon, Fabien, et autres
Publié: (2025)

$k$-Center Clustering in Distributed Models
par: Biabani, Leyla, et autres
Publié: (2024)

The Quantum Message Complexity of Distributed Wake-Up with Advice
par: Robinson, Peter, et autres
Publié: (2026)

On the Randomized Locality of Matching Problems in Regular Graphs
par: Khoury, Seri, et autres
Publié: (2025)

Massively Parallel Algorithms for Approximate Shortest Paths
par: Dory, Michal, et autres
Publié: (2024)

When MIS and Maximal Matching are Easy in the Congested Clique
par: Censor-Hillel, Keren, et autres
Publié: (2025)

Improved All-Pairs Approximate Shortest Paths in Congested Clique
par: Bui, Hong Duc, et autres
Publié: (2024)

Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model
par: Chang, Yi-Jun, et autres
Publié: (2023)

Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling
par: Dhulipala, Laxman, et autres
Publié: (2024)

Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs
par: Boneh, Itai, et autres
Publié: (2025)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
par: Ghaffari, Mohsen, et autres
Publié: (2025)

Faster Multi-Source Reachability and Approximate Distances via Shortcuts, Hopsets and Matrix Multiplication
par: Elkin, Michael, et autres
Publié: (2025)