Image de couverture de livre

Deterministic Edge Coloring with few Colors in CONGEST

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Blikstad, Joakim, Maus, Yannic, de Vos, Tijn
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Distributed Sparsest Cut via Eigenvalue Estimation
par: Maus, Yannic, et autres
Publié: (2025)

Deterministic Online Bipartite Edge Coloring
par: Blikstad, Joakim, et autres
Publié: (2024)

Online Edge Coloring: Sharp Thresholds
par: Blikstad, Joakim, et autres
Publié: (2025)

Online Edge Coloring is (Nearly) as Easy as Offline
par: Blikstad, Joakim, et autres
Publié: (2024)

Towards Optimal Distributed Edge Coloring with Fewer Colors
par: Jakob, Manuel, et autres
Publié: (2025)

Towards Optimal Distributed Delta Coloring
par: Jakob, Manuel, et autres
Publié: (2025)

Distributed Santa Claus via Global Rounding
par: de Vos, Tijn, et autres
Publié: (2026)

Distributed Delta-Coloring under Bandwidth Limitations
par: Maus, Yannic, et autres
Publié: (2024)

Efficient Matroid Intersection via a Batch-Update Auction Algorithm
par: Blikstad, Joakim, et autres
Publié: (2024)

Dynamic Matroids: Base Packing and Covering
par: de Vos, Tijn, et autres
Publié: (2025)

Sublogarithmic Distributed Vertex Coloring with Optimal Number of Colors
par: Flin, Maxime, et autres
Publié: (2026)

Fast Deterministic Distributed Degree Splitting
par: Maus, Yannic, et autres
Publié: (2026)

Adaptive Massively Parallel Coloring in Sparse Graphs
par: Latypov, Rustam, et autres
Publié: (2024)

Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity
par: de Vos, Tijn, et autres
Publié: (2024)

Towards Constant Time Multi-Call Rumor Spreading on Small-Set Expanders
par: Cruciani, Emilio, et autres
Publié: (2025)

Global vs. s-t Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions & Near-Optimal Separations
par: Blikstad, Joakim, et autres
Publié: (2025)

Maximum Flow by Augmenting Paths in $n^{2+o(1)}$ Time
par: Bernstein, Aaron, et autres
Publié: (2024)

Deterministic Simple $(Δ+\varepsilonα)$-Edge-Coloring in Near-Linear Time
par: Elkin, Michael, et autres
Publié: (2024)

New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths
par: Dory, Michal, et autres
Publié: (2022)

Girth Approximations in the CONGEST Model
par: Chechik, Shiri, et autres
Publié: (2026)

On Distributed Colouring of Hyperbolic Random Graphs
par: Maus, Yannic, et autres
Publié: (2025)

Coloring tournaments with few colors: Algorithms and complexity
par: Klingelhoefer, Felix, et autres
Publié: (2023)

Deterministic Even-Cycle Detection in Broadcast CONGEST
par: Fraigniaud, Pierre, et autres
Publié: (2024)

Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring
par: Baguley, Samuel, et autres
Publié: (2024)

Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs
par: Bernstein, Aaron, et autres
Publié: (2025)

Faster Deterministic Streaming Vertex Coloring
par: Chechik, Shiri, et autres
Publié: (2026)

Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense Instances
par: Brand, Jan van den, et autres
Publié: (2025)

Dynamic Edge Coloring of Forests
par: Kaplan, Haim, et autres
Publié: (2026)

Improved Streaming Edge Coloring
par: Chechik, Shiri, et autres
Publié: (2025)

Distributed Treewidth Computation and Courcelle's Theorem in the CONGEST Model
par: Jauregui, Benjamin, et autres
Publié: (2018)

Faster Edge Coloring by Partition Sieving
par: Akmal, Shyan, et autres
Publié: (2025)

Arboricity-Dependent Algorithms for Edge Coloring
par: Bhattacharya, Sayan, et autres
Publié: (2023)

Overlapping and Robust Edge-Colored Clustering in Hypergraphs
par: Crane, Alex, et autres
Publié: (2023)

Streaming Edge Coloring with Subquadratic Palette Size
par: Chechik, Shiri, et autres
Publié: (2023)

On the Complexity of Distributed Edge Coloring and Orientation Problems
par: Brandt, Sebastian, et autres
Publié: (2025)

Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs
par: Baumecker, Malte, et autres
Publié: (2025)

Faster Vizing and Near-Vizing Edge Coloring Algorithms
par: Assadi, Sepehr
Publié: (2024)

Density-Sensitive Algorithms for $(Δ+ 1)$-Edge Coloring
par: Bhattacharya, Sayan, et autres
Publié: (2023)

Greedy Algorithms for Shortcut Sets and Hopsets
par: Bals, Ben, et autres
Publié: (2025)

Deterministic Dynamic Edge Colouring
par: Christiansen, Aleksander B. G.
Publié: (2024)