Pages that link to "Item:Q4980035"
From MaRDI portal
The following pages link to Distributed Graph Coloring: Fundamentals and Recent Developments (Q4980035):
Displaying 50 items.
- Randomised distributed MIS and colouring algorithms for rings with oriented edges in \(O(\sqrt{\log n})\) bit rounds (Q342718) (← links)
- Price of anarchy for graph coloring games with concave payoff (Q501743) (← links)
- Distributed algorithms for random graphs (Q888436) (← links)
- A fast network-decomposition algorithm and its applications to constant-time distributed computation (Q1625605) (← links)
- Linear-in-\(\varDelta \) lower bounds in the LOCAL model (Q1689747) (← links)
- Deterministic distributed construction of \(T\)-dominating sets in time \(T\) (Q1786883) (← links)
- Improved distributed \(\Delta\)-coloring (Q1981630) (← links)
- Distributed backup placement (Q2084982) (← links)
- Local mending (Q2097329) (← links)
- Linial for lists (Q2104037) (← links)
- Distributed algorithms for fractional coloring (Q2117704) (← links)
- Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q2146871) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- A hierarchy of local decision (Q2219059) (← links)
- Computing fault-containment times of self-stabilizing algorithms using lumped Markov chains (Q2283837) (← links)
- Distributed coloring in sparse graphs with fewer colors (Q2335690) (← links)
- A fast distributed algorithm for \((\Delta+1)\)-edge-coloring (Q2664558) (← links)
- Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms (Q2684542) (← links)
- Deterministic Subgraph Detection in Broadcast CONGEST. (Q3300802) (← links)
- Exact Bounds for Distributed Graph Colouring (Q3460706) (← links)
- Simple Distributed Δ + 1 Coloring in the SINR Model (Q3460713) (← links)
- Nearly Optimal Local Broadcasting in the SINR Model with Feedback (Q3460714) (← links)
- A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (Q3460717) (← links)
- Locality in Distributed Graph Algorithms (Q3990110) (← links)
- A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (Q4997313) (← links)
- Improved Dynamic Graph Coloring (Q5009642) (← links)
- Introduction to local certification (Q5024672) (← links)
- (Q5090456) (← links)
- Distributed Recoloring (Q5090902) (← links)
- Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set (Q5090921) (← links)
- Equilibria of Games in Networks for Local Tasks (Q5091077) (← links)
- When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (Q5091165) (← links)
- (Q5092346) (← links)
- Network Decomposition and Distributed Derandomization (Invited Paper) (Q5100942) (← links)
- Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering (Q5112251) (← links)
- Distributed Coloring in Sparse Graphs with Fewer Colors (Q5197707) (← links)
- Distributed Lower Bounds for Ruling Sets (Q5863326) (← links)
- Improved distributed algorithms for coloring interval graphs with application to multicoloring trees (Q5919420) (← links)
- Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074) (← links)
- Making local algorithms wait-free: the case of ring coloring (Q5920224) (← links)
- Node and edge averaged complexities of local graph problems (Q6071120) (← links)
- Locally checkable problems in rooted trees (Q6096035) (← links)
- On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition (Q6098462) (← links)
- Distributed algorithms, the Lovász local lemma, and descriptive combinatorics (Q6107878) (← links)
- Lower bound for constant-size local certification (Q6155248) (← links)
- A note on the network coloring game: a randomized distributed \((\Delta+1)\)-coloring algorithm (Q6161445) (← links)
- Local conflict coloring revisited: Linial for lists (Q6535013) (← links)
- Coloring fast without learning your neighbors' colors (Q6535038) (← links)
- Self-stabilizing \((\varDelta +1)\)-coloring in sublinear (in \(\varDelta\)) rounds via locally-iterative algorithms (Q6591474) (← links)
- Borel Vizing's theorem for graphs of subexponential growth (Q6654016) (← links)
