scientific article; zbMATH DE number 7525452
From MaRDI portal
Publication:5075750
DOI10.4230/LIPIcs.ESA.2019.15MaRDI QIDQ5075750
Mahsa Derakhshan, Soheil Behnezhad, Hamed Saleh, Marina Knittel, Mohammad Taghi Hajiaghayi
Publication date: 11 May 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Parallel \((\Delta +1)\)-coloring of constant-degree graphs
- Simple distributed \(\Delta+1\)-coloring of graphs
- Breaking the linear-memory barrier in MPC: fast MIS on trees with strongly sublinear memory
- Sorting, Searching, and Simulation in the MapReduce Framework
- The Locality of Distributed Symmetry Breaking
- An Efficient Algorithm for Colouring the Edges of a Graph With Δ + 1 Colours
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- Locality in Distributed Graph Algorithms
- Communication Steps for Parallel Query Processing
- (Delta+1) Coloring in the Congested Clique Model
- Brief Announcement: MapReduce Algorithms for Massive Trees
- Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds
- The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation
- On the complexity of distributed graph coloring
- Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover
- Round compression for parallel matching algorithms
- Sublinear Algorithms for (Δ + 1) Vertex Coloring
- Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs
- Parallel algorithms for geometric graph problems
- Fast randomized algorithms for distributed edge coloring
- Distributed (∆+1)-coloring in sublogarithmic rounds
- Automata, Languages and Programming
- Trading off space for passes in graph streaming problems
This page was built for publication:
