Pages that link to "Item:Q4344228"
From MaRDI portal
The following pages link to Nearly optimal distributed edge coloring in O(log log n) rounds (Q4344228):
Displaying 13 items.
- Randomised distributed MIS and colouring algorithms for rings with oriented edges in \(O(\sqrt{\log n})\) bit rounds (Q342718) (← links)
- Link scheduling in wireless sensor networks: distributed edge-coloring revisited (Q436862) (← links)
- A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems (Q845924) (← links)
- Near-optimal, distributed edge colouring via the nibble method (Q1274333) (← links)
- Distributed edge coloration for bipartite networks (Q2377126) (← links)
- (Q4608064) (← links)
- A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds (Q4640294) (← links)
- Distance edge coloring and collision‐free communication in wireless sensor networks (Q5326804) (← links)
- A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds (Q5361909) (← links)
- Superfast coloring in CONGEST via efficient color sampling (Q5918634) (← links)
- Distributed deterministic edge coloring using bounded neighborhood independence (Q5920296) (← links)
- Superfast coloring in CONGEST via efficient color sampling (Q5925614) (← links)
- Near-optimal distributed edge coloring (Q6102321) (← links)
