Cover Image

Round and Communication Efficient Graph Coloring

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chang, Yi-Jun, Mishra, Gopinath, Nguyen, Hung Thuan, Salim, Farrel D
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Distributed, Parallel, and Cluster Computing
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Overlay Network Construction: Improved Overall and Node-Wise Message Complexity
by: Chang, Yi-Jun, et al.
Published: (2024)

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

Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks
by: Chang, Yi-Jun, et al.
Published: (2026)

Low-Distortion Clustering in Bounded Growth Graphs
by: Chang, Yi-Jun, et al.
Published: (2024)

Tight Bounds for Constant-Round Domination on Graphs of High Girth and Low Expansion
by: Lenzen, Christoph, et al.
Published: (2024)

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

Round-Delayed Amnesiac Flooding
by: Alafin, Oluwatobi, et al.
Published: (2026)

Sorting in One and Two Rounds using $t$-Comparators
by: Gelles, Ran, et al.
Published: (2024)

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

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

Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions
by: Chang, Yi-Jun, et al.
Published: (2022)

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

Improved Massively Parallel Triangle Counting in $O(1)$ Rounds
by: Liu, Quanquan C., et al.
Published: (2024)

What Can We Compute in a Single Round of the Congested Clique?
by: Robinson, Peter
Published: (2022)

Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching
by: Khoury, Seri, et al.
Published: (2025)

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

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

Fast Broadcast in Highly Connected Networks
by: Chandra, Shashwat, et al.
Published: (2024)

Improved All-Pairs Approximate Shortest Paths in Congested Clique
by: Bui, Hong Duc, et al.
Published: (2024)

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)

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

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)

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
by: Blin, Lelia, et al.
Published: (2026)

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)

Multi-Agent Online Graph Exploration on Cycles and Tadpole Graphs
by: Akker, Erik van den, et al.
Published: (2024)

Efficient Distributed Data Structures for Future Many-core Architectures
by: Fatourou, Panagiota, et al.
Published: (2024)

Distributed Triangle Detection is Hard in Few Rounds
by: Assadi, Sepehr, et al.
Published: (2025)

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

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

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

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

PASGAL: Parallel And Scalable Graph Algorithm Library
by: Dong, Xiaojun, et al.
Published: (2024)

On the Randomized Locality of Matching Problems in Regular Graphs
by: Khoury, Seri, et al.
Published: (2025)

The Local Information Cost of Distributed Graph Spanners
by: Robinson, Peter
Published: (2020)

Designing Parallel Algorithms for Community Detection using Arachne
by: Li, Fuhuan, et al.
Published: (2025)