Cover Image

Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Khoury, Seri, Schild, Aaron
Format:	Preprint
Published:	2025
Subjects:	Distributed, Parallel, and Cluster Computing Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Breaking Barriers for Distributed MIS by Faster Degree Reduction
by: Khoury, Seri, et al.
Published: (2025)

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

Distributed Santa Claus via Global Rounding
by: de Vos, Tijn, et al.
Published: (2026)

On Distributed Computation of the Minimum Triangle Edge Transversal
by: Censor-Hillel, Keren, et al.
Published: (2024)

Parallel Dynamic Maximal Matching
by: Ghaffari, Mohsen, et al.
Published: (2024)

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

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

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

Faster Distributed $Δ$-Coloring via a Reduction to MIS
by: Bourreau, Yann, et al.
Published: (2025)

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

Round-Delayed Amnesiac Flooding
by: Alafin, Oluwatobi, et al.
Published: (2026)

Round and Communication Efficient Graph Coloring
by: Chang, Yi-Jun, et al.
Published: (2024)

Sorting in One and Two Rounds using $t$-Comparators
by: Gelles, Ran, et al.
Published: (2024)

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

Improved Massively Parallel Triangle Counting in $O(1)$ Rounds
by: Liu, Quanquan C., et al.
Published: (2024)

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

Distributed Triangle Detection is Hard in Few Rounds
by: Assadi, Sepehr, et al.
Published: (2025)

Tight Bounds for Constant-Round Domination on Graphs of High Girth and Low Expansion
by: Lenzen, Christoph, et al.
Published: (2024)

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

Efficient Enumeration of Large Maximal k-Plexes
by: Cheng, Qihao, et al.
Published: (2024)

Parallel Batch-Dynamic Maximal Independent Set
by: Blelloch, Guy, et al.
Published: (2026)

Energy-Efficient Maximal Independent Sets in Radio Networks
by: Banasik, Dominick, et al.
Published: (2025)

Fast and Space-Efficient Parallel Algorithms for Influence Maximization
by: Wang, Letong, et al.
Published: (2023)

Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions
by: Chang, Yi-Jun, et al.
Published: (2022)

Enhancing Scalability and Performance in Influence Maximization with Optimized Parallel Processing
by: Wu, Hanjiang, et al.
Published: (2024)

Faster Distributed $Δ$-Coloring via Ruling Subgraphs
by: Bourreau, Yann, et al.
Published: (2025)

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

Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights
by: Ashvinkumar, Vikrant, et al.
Published: (2023)

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

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

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

Optimal Distributed Replacement Paths
by: Chang, Yi-Jun, et al.
Published: (2025)

Bounded Memory in Distributed Networks
by: Basat, Ran Ben, et al.
Published: (2025)

Distributed Graph Algorithms with Predictions
by: Boyar, Joan, et al.
Published: (2025)

Distributed Stochastic Graph Algorithms
by: Censor-Hillel, Keren, et al.
Published: (2026)

Towards Optimal Distributed Delta Coloring
by: Jakob, Manuel, et al.
Published: (2025)

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

Fast Deterministic Distributed Degree Splitting
by: Maus, Yannic, et al.
Published: (2026)

Meta-Theorems for Cuttable Distributed Problems
by: Bonamy, Marthe, et al.
Published: (2026)

Distributed Subgraph Finding: Progress and Challenges
by: Censor-Hillel, Keren
Published: (2022)