scientific article; zbMATH DE number 7561635

DOI10.4230/LIPIcs.ICALP.2019.142MaRDI QIDQ5092346

Mohsen Ghaffari, Ali Sayyadi

Publication date: 21 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph coloringdistributed computingrandomized algorithmsmessage passing algorithmsarboricitycongested clique model

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Lessons from the congested clique applied to MapReduce
• Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
• Simple distributed \(\Delta+1\)-coloring of graphs
• Distributed symmetry-breaking algorithms for congested cliques
• Locality in Distributed Graph Algorithms
• Distributed Computing: A Locality-Sensitive Approach
• Distributed Graph Coloring: Fundamentals and Recent Developments
• The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation
• Optimal deterministic routing and sorting on the congested clique
• Locally-Iterative Distributed (Δ+ 1)
• An optimal distributed (Δ+1)-coloring algorithm?
• Distributed Maximal Independent Set using Small Messages
• MST in Log-Star Rounds of Congested Clique
• Distributed MIS via All-to-All Communication
• Deterministic Distributed Vertex Coloring in Polylogarithmic Time
• Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
• Decomposition of Finite Graphs Into Forests

This page was built for publication: