Linial for lists (Q2104037)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Linial for lists	scientific article

Statements

scholarly article

0 references

Linial for lists (English)

0 references

0 references

0 references

Distributed Computing

0 references

publication date

9 December 2022

0 references

zbMATH Keywords

deterministic distributed coloring

0 references

color reduction

0 references

cover-free family

0 references

list coloring

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00446-022-00424-y

0 references

Brief Announcement: Classification of Distributed Binary Labeling Problems

0 references

Lower Bounds for Maximal Matchings and Maximal Independent Sets

0 references

Distributed Lower Bounds for Ruling Sets

0 references

Locality of not-so-weak coloring

0 references

Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta

0 references

Efficient Deterministic Distributed Coloring with Small Bandwidth

0 references

Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty Networks

0 references

Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition

0 references

Deterministic Distributed Vertex Coloring in Polylogarithmic Time

0 references

Distributed Graph Coloring: Fundamentals and Recent Developments

0 references

Locally-Iterative Distributed (Δ+ 1)

0 references

Distributed $(\Delta+1)$-Coloring in Linear (in $\Delta$) Time

0 references

The Locality of Distributed Symmetry Breaking

0 references

A fast distributed algorithm for \((\Delta+1)\)-edge-coloring

0 references

An Automatic Speedup Theorem for Distributed Problems

0 references

A lower bound for the distributed Lovász local lemma

0 references

Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants

0 references

An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model

0 references

An optimal distributed (Δ+1)-coloring algorithm?

0 references

Families of finite sets in which no set is covered by the union of \(r\) others

0 references

On the complexity of distributed graph coloring with local minimality constraints

0 references

Improved Distributed Delta-Coloring

0 references

Improved distributed degree splitting and edge coloring

0 references

On the complexity of local distributed graph problems

0 references

Deterministic distributed edge-coloring with fewer colors

0 references

Distributed Degree Splitting, Edge Coloring, and Orientations

0 references

Distributed (Δ +1)-Coloring in Sublogarithmic Rounds

0 references

Polynomial lower bound for distributed graph coloring in a weak LOCAL model

0 references

0 references

Faster Deterministic Distributed Coloring Through Recursive List Coloring

0 references

Local Computation

0 references

On the complexity of distributed graph coloring

0 references

Locality in Distributed Graph Algorithms

0 references

A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring

0 references

Some simple distributed algorithms for sparse networks

0 references

Distributed Computing: A Locality-Sensitive Approach

0 references

Polylogarithmic-time deterministic network decomposition and distributed derandomization

0 references

Towards the locality of Vizing’s theorem

0 references

Locality based graph coloring

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1007/S00446-022-00424-Y

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2104037

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2104037&oldid=38880983"