Imagen de Portada

Sublogarithmic Distributed Vertex Coloring with Optimal Number of Colors

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Flin, Maxime, Halldórsson, Magnús M., Jakob, Manuel, Maus, Yannic
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms Distributed, Parallel, and Cluster Computing
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

Towards Optimal Distributed Delta Coloring
por: Jakob, Manuel, et al.
Publicado: (2025)

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

Decentralized Distributed Graph Coloring: Cluster Graphs
por: Flin, Maxime, et al.
Publicado: (2024)

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

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

Adaptive Massively Parallel Coloring in Sparse Graphs
por: Latypov, Rustam, 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)

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)

Parallel Batch Dynamic Vertex Coloring in $O(\log Δ)$ Amortized Update Time
por: Hutton, Chase, 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)

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

Optimal Distributed Replacement Paths
por: Chang, Yi-Jun, 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)

Simpler and More General Distributed Coloring Based on Simple List Defective Coloring Algorithms
por: Fuchs, Marc, et al.
Publicado: (2024)

A Fast-Converging Decentralized Approach to the Weighted Minimum Vertex Cover Problem
por: Mordacchini, Matteo, 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)

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

Beyond Brooks: $(Δ-1)$-Coloring in Semi-Streaming
por: Flin, Maxime, et al.
Publicado: (2026)

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

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

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)

Faster Dynamic $(Δ+1)$-Coloring Against Adaptive Adversaries
por: Flin, Maxime, et al.
Publicado: (2025)

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

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

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)

Efficient Parallel $(Δ+1)$-Edge-Coloring
por: Elkin, Michael, 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)

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

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

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)