Cover Image

Simpler and More General Distributed Coloring Based on Simple List Defective Coloring Algorithms

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Fuchs, Marc, Kuhn, Fabian
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Distributed, Parallel, and Cluster Computing Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Efficient Parallel $(Δ+1)$-Edge-Coloring
by: Elkin, Michael, et al.
Published: (2026)

Parallelizing the Approximate Minimum Degree Ordering Algorithm: Strategies and Evaluation
by: Chang, Yen-Hsiang, et al.
Published: (2025)

A Randomised Approach to Distributed Sorting
by: Olesker-Taylor, Sam
Published: (2025)

Renaming in distributed certification
by: Bousquet, Nicolas, et al.
Published: (2024)

Local certification of forbidden subgraphs
by: Bousquet, Nicolas, et al.
Published: (2024)

A subquadratic certification scheme for P5-free graphs
by: Bousquet, Nicolas, et al.
Published: (2024)

Complexity landscape for local certification
by: Bousquet, Nicolas, et al.
Published: (2025)

Local Ratio based Real-time Job Offloading and Resource Allocation in Mobile Edge Computing
by: Gao, Chuanchao, et al.
Published: (2025)

Computing in Anonymous Dynamic Networks Is Linear
by: Di Luna, Giuseppe A., et al.
Published: (2022)

Distributed $(Δ+1)$-Coloring in Graphs of Bounded Neighborhood Independence
by: Fuchs, Marc, et al.
Published: (2025)

Reductions in local certification
by: Esperet, Louis, et al.
Published: (2025)

Scheduled Jacobian Chaining
by: Märtens, Simon, et al.
Published: (2025)

Fast algorithms for Vizing's theorem on bounded degree graphs
by: Bernshteyn, Anton, et al.
Published: (2023)

Model-Agnostic Approximation of Constrained Forest Problems
by: Coupette, Corinna, et al.
Published: (2024)

GenTT: Generate Vectorized Codes for General Tensor Permutation
by: Chen, Yaojian, et al.
Published: (2025)

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

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

Improved Distributed Algorithms for Random Colorings
by: Carlson, Charlie, et al.
Published: (2023)

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

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

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

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

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

A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
by: Li, Qian, et al.
Published: (2024)

A $(3+\varepsilon)$-Approximate Correlation Clustering Algorithm in Dynamic Streams
by: Cambus, Mélanie, et al.
Published: (2022)

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

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

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

A Simple Distributed Deterministic Planar Separator
by: Abd-Elhaleem, Yaseen, et al.
Published: (2026)

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

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

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

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

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

Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
by: Chang, Yi-Jun
Published: (2023)

Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs
by: Bonamy, Marthe, et al.
Published: (2025)

A Tight Meta-theorem for LOCAL Certification of MSO$_2$ Properties within Bounded Treewidth Graphs
by: Cook, Linda, et al.
Published: (2025)

Deterministic Expander Routing: Faster and More Versatile
by: Chang, Yi-Jun, et al.
Published: (2024)

Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs
by: Faour, Salwa, et al.
Published: (2025)

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