Faster Distributed $Δ$-Coloring via a Reduction to MIS
Fuente:
arXiv
Saved in:
| Main Authors: | Bourreau, Yann, Brandt, Sebastian, Nolin, Alexandre |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Faster Distributed $Δ$-Coloring via Ruling Subgraphs
by: Bourreau, Yann, et al.
Published: (2025)
by: Bourreau, Yann, et al.
Published: (2025)
Optimal Deterministic Rendezvous in Labeled Lines
by: Bourreau, Yann, et al.
Published: (2025)
by: Bourreau, Yann, et al.
Published: (2025)
Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual Graphs
by: Flin, Maxime, et al.
Published: (2024)
by: Flin, Maxime, et al.
Published: (2024)
Breaking Barriers for Distributed MIS by Faster Degree Reduction
by: Khoury, Seri, et al.
Published: (2025)
by: Khoury, Seri, et al.
Published: (2025)
Fast Deterministic Distributed Degree Splitting
by: Maus, Yannic, et al.
Published: (2026)
by: Maus, Yannic, et al.
Published: (2026)
Decentralized Distributed Graph Coloring: Cluster Graphs
by: Flin, Maxime, et al.
Published: (2024)
by: Flin, Maxime, et al.
Published: (2024)
Content-Oblivious Leader Election on Rings
by: Frei, Fabian, et al.
Published: (2024)
by: Frei, Fabian, et al.
Published: (2024)
Parallel Batch Dynamic Vertex Coloring in $O(\log Δ)$ Amortized Update Time
by: Hutton, Chase, et al.
Published: (2025)
by: Hutton, Chase, et al.
Published: (2025)
Towards Optimal Distributed Edge Coloring with Fewer Colors
by: Jakob, Manuel, et al.
Published: (2025)
by: Jakob, Manuel, et al.
Published: (2025)
Sublogarithmic Distributed Vertex Coloring with Optimal Number of Colors
by: Flin, Maxime, et al.
Published: (2026)
by: Flin, Maxime, et al.
Published: (2026)
Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching
by: Khoury, Seri, et al.
Published: (2025)
by: Khoury, Seri, et al.
Published: (2025)
When MIS and Maximal Matching are Easy in the Congested Clique
by: Censor-Hillel, Keren, et al.
Published: (2025)
by: Censor-Hillel, Keren, et al.
Published: (2025)
Towards Optimal Distributed Delta Coloring
by: Jakob, Manuel, et al.
Published: (2025)
by: Jakob, Manuel, et al.
Published: (2025)
Efficient Parallel $(Δ+1)$-Edge-Coloring
by: Elkin, Michael, et al.
Published: (2026)
by: Elkin, Michael, et al.
Published: (2026)
Distributed Delta-Coloring under Bandwidth Limitations
by: Maus, Yannic, et al.
Published: (2024)
by: Maus, Yannic, et al.
Published: (2024)
Faster Multi-Source Reachability and Approximate Distances via Shortcuts, Hopsets and Matrix Multiplication
by: Elkin, Michael, et al.
Published: (2025)
by: Elkin, Michael, et al.
Published: (2025)
Faster Cycle Detection in the Congested Clique
by: Censor-Hillel, Keren, et al.
Published: (2024)
by: Censor-Hillel, Keren, et al.
Published: (2024)
Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
by: Ghaffari, Mohsen, et al.
Published: (2024)
by: Ghaffari, Mohsen, et al.
Published: (2024)
Distributed Reductions for the Maximum Weight Independent Set Problem
by: Borowitz, Jannick, et al.
Published: (2025)
by: Borowitz, Jannick, et al.
Published: (2025)
Deterministic Expander Routing: Faster and More Versatile
by: Chang, Yi-Jun, et al.
Published: (2024)
by: Chang, Yi-Jun, et al.
Published: (2024)
Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
by: Ghaffari, Mohsen, et al.
Published: (2025)
by: Ghaffari, Mohsen, et al.
Published: (2025)
On the Locality of Hall's Theorem
by: Brandt, Sebastian, et al.
Published: (2025)
by: Brandt, Sebastian, et al.
Published: (2025)
Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation
by: Blelloch, Guy, et al.
Published: (2026)
by: Blelloch, Guy, et al.
Published: (2026)
TC-MIS: Maximal Independent Set on Tensor-cores
by: Nijhara, Prajjwal, et al.
Published: (2026)
by: Nijhara, Prajjwal, et al.
Published: (2026)
Distributed Santa Claus via Global Rounding
by: de Vos, Tijn, et al.
Published: (2026)
by: de Vos, Tijn, et al.
Published: (2026)
Round and Communication Efficient Graph Coloring
by: Chang, Yi-Jun, et al.
Published: (2024)
by: Chang, Yi-Jun, et al.
Published: (2024)
Adaptive Massively Parallel Coloring in Sparse Graphs
by: Latypov, Rustam, et al.
Published: (2024)
by: Latypov, Rustam, et al.
Published: (2024)
A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model
by: Chang, Yi-Jun, et al.
Published: (2023)
by: Chang, Yi-Jun, et al.
Published: (2023)
Optimal Distributed Replacement Paths
by: Chang, Yi-Jun, et al.
Published: (2025)
by: Chang, Yi-Jun, et al.
Published: (2025)
Bounded Memory in Distributed Networks
by: Basat, Ran Ben, et al.
Published: (2025)
by: Basat, Ran Ben, et al.
Published: (2025)
Distributed Graph Algorithms with Predictions
by: Boyar, Joan, et al.
Published: (2025)
by: Boyar, Joan, et al.
Published: (2025)
Distributed Stochastic Graph Algorithms
by: Censor-Hillel, Keren, et al.
Published: (2026)
by: Censor-Hillel, Keren, et al.
Published: (2026)
Slipstream: Ebb-and-Flow Consensus on a DAG with Fast Confirmation for UTXO Transactions
by: Polyanskii, Nikita, et al.
Published: (2024)
by: Polyanskii, Nikita, et al.
Published: (2024)
Distributed Maximum Flow in Planar Graphs
by: Abd-Elhaleem, Yaseen, et al.
Published: (2024)
by: Abd-Elhaleem, Yaseen, et al.
Published: (2024)
Meta-Theorems for Cuttable Distributed Problems
by: Bonamy, Marthe, et al.
Published: (2026)
by: Bonamy, Marthe, et al.
Published: (2026)
Distributed Subgraph Finding: Progress and Challenges
by: Censor-Hillel, Keren
Published: (2022)
by: Censor-Hillel, Keren
Published: (2022)
Local Density and its Distributed Approximation
by: Christiansen, Aleksander Bjørn, et al.
Published: (2024)
by: Christiansen, Aleksander Bjørn, et al.
Published: (2024)
$k$-Center Clustering in Distributed Models
by: Biabani, Leyla, et al.
Published: (2024)
by: Biabani, Leyla, et al.
Published: (2024)
Congested Clique Counting for Local Gibbs Distributions
by: Sobel, Joshua Z.
Published: (2025)
by: Sobel, Joshua Z.
Published: (2025)
A Simple and Robust Protocol for Distributed Counting
by: Cohen, Edith, et al.
Published: (2025)
by: Cohen, Edith, et al.
Published: (2025)
Similar Items
-
Faster Distributed $Δ$-Coloring via Ruling Subgraphs
by: Bourreau, Yann, et al.
Published: (2025) -
Optimal Deterministic Rendezvous in Labeled Lines
by: Bourreau, Yann, et al.
Published: (2025) -
Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual Graphs
by: Flin, Maxime, et al.
Published: (2024) -
Breaking Barriers for Distributed MIS by Faster Degree Reduction
by: Khoury, Seri, et al.
Published: (2025) -
Fast Deterministic Distributed Degree Splitting
by: Maus, Yannic, et al.
Published: (2026)