Linial for lists
From MaRDI portal
Publication:2104037
Recommendations
- Distributed \((\Delta+1)\)-coloring in sublogarithmic rounds
- Distributed \((\Delta+1)\)-coloring in sublogarithmic rounds
- Distributed \((\Delta+1)\)-coloring in linear (in \(\Delta\)) time
- Deterministic distributed vertex coloring in polylogarithmic time
- Distributed \(({\Delta}+1)\)-coloring in linear (in \({\Delta})\) time
Cites work
- scientific article; zbMATH DE number 4043100 (Why is no real title available?)
- A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring
- A fast distributed algorithm for \((\Delta+1)\)-edge-coloring
- A lower bound for the distributed Lovász local lemma
- An Automatic Speedup Theorem for Distributed Problems
- An exponential separation between randomized and deterministic complexity in the LOCAL model
- An optimal distributed (+1)-coloring algorithm?
- Brief Announcement: Classification of Distributed Binary Labeling Problems
- Deterministic (+1)-coloring in sublinear (in ) time in static, dynamic, and faulty networks
- Deterministic distributed edge-coloring with fewer colors
- Deterministic distributed vertex coloring in polylogarithmic time
- Distributed Computing: A Locality-Sensitive Approach
- Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta
- Distributed Graph Coloring: Fundamentals and Recent Developments
- Distributed Lower Bounds for Ruling Sets
- Distributed \((\Delta+1)\)-coloring in linear (in \(\Delta\)) time
- Distributed \((\Delta+1)\)-coloring in sublogarithmic rounds
- Distributed degree splitting, edge coloring, and orientations
- Efficient Deterministic Distributed Coloring with Small Bandwidth
- Families of finite sets in which no set is covered by the union of \(r\) others
- Faster Deterministic Distributed Coloring Through Recursive List Coloring
- Improved distributed degree splitting and edge coloring
- Improved distributed delta-coloring
- Local computation: lower and upper bounds
- Locality based graph coloring
- Locality in Distributed Graph Algorithms
- Locality of not-so-weak coloring
- Locally-iterative distributed \((\Delta+1)\)-coloring below Szegedy-Vishwanathan barrier, and applications to self-stabilization and to restricted-bandwidth models
- Lower Bounds for Maximal Matchings and Maximal Independent Sets
- On the complexity of distributed graph coloring
- On the complexity of distributed graph coloring with local minimality constraints
- On the complexity of local distributed graph problems
- Polylogarithmic-time deterministic network decomposition and distributed derandomization
- Polynomial lower bound for distributed graph coloring in a weak LOCAL model
- Some simple distributed algorithms for sparse networks
- Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
- The locality of distributed symmetry breaking
- Towards the locality of Vizing's theorem
- Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants
Cited in
(7)- A representation for linear lists with movable fingers
- Adaptive massively parallel coloring in sparse graphs
- Brief announcement: Local advice and local decompression
- Padded Lists Revisited
- Distributed coloring of hypergraphs
- Improved dynamic colouring of sparse graphs
- Local conflict coloring revisited: Linial for lists
This page was built for publication: Linial for lists
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104037)
