Imagen de Portada

Towards Optimal Distributed Delta Coloring

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Jakob, Manuel, Maus, Yannic
Formato:	Preprint
Publicado:	2025
Materias:	Distributed, Parallel, and Cluster Computing 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

Towards Optimal Distributed Edge Coloring with Fewer Colors
por: Jakob, Manuel, et al.
Publicado: (2025)

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

Distributed Delta-Coloring under Bandwidth Limitations
por: Maus, Yannic, et al.
Publicado: (2024)

Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs
por: Baumecker, Malte, et al.
Publicado: (2025)

Fast Deterministic Distributed Degree Splitting
por: Maus, Yannic, et al.
Publicado: (2026)

Adaptive Massively Parallel Coloring in Sparse Graphs
por: Latypov, Rustam, et al.
Publicado: (2024)

Distributed Lovász Local Lemma under Bandwidth Limitations
por: Halldórsson, Magnús M., et al.
Publicado: (2024)

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

On the Locality of Hall's Theorem
por: Brandt, Sebastian, et al.
Publicado: (2025)

Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual Graphs
por: Flin, Maxime, et al.
Publicado: (2024)

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

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

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

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

A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP
por: Ghaffari, Mohsen, et al.
Publicado: (2024)

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

Near-optimal population protocols on bounded-degree trees
por: Rybicki, Joel, et al.
Publicado: (2026)

Optimal Deterministic Rendezvous in Labeled Lines
por: Bourreau, Yann, et al.
Publicado: (2025)

Near-Optimal Resilient Labeling Schemes
por: Censor-Hillel, Keren, et al.
Publicado: (2024)

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

Optimal local certification on graphs of bounded pathwidth
por: Baterisna, Dan Alden, et al.
Publicado: (2025)

A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model
por: Chang, Yi-Jun, et al.
Publicado: (2023)

Almost Optimal Algorithms for Token Collision in Anonymous Networks
por: Bai, Sirui, et al.
Publicado: (2024)

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

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

Distributed Graph Algorithms with Predictions
por: Boyar, Joan, et al.
Publicado: (2025)

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

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

Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
por: Dhulipala, Laxman, et al.
Publicado: (2024)

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

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

Distributed Subgraph Finding: Progress and Challenges
por: Censor-Hillel, Keren
Publicado: (2022)

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

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

Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
por: Ghaffari, Mohsen, et al.
Publicado: (2024)

Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model
por: Manoharan, Vignesh, et al.
Publicado: (2022)

Congested Clique Counting for Local Gibbs Distributions
por: Sobel, Joshua Z.
Publicado: (2025)

A Simple and Robust Protocol for Distributed Counting
por: Cohen, Edith, et al.
Publicado: (2025)

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

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