Pages that link to "Item:Q1606946"

The following pages link to Simple distributed \(\Delta+1\)-coloring of graphs (Q1606946):

Displaying 31 items.

• Randomised distributed MIS and colouring algorithms for rings with oriented edges in \(O(\sqrt{\log n})\) bit rounds (Q342718) (← links)
• On the time and the bit complexity of distributed randomised anonymous ring colouring (Q391396) (← links)
• Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings (Q391647) (← links)
• Symmetry breaking depending on the chromatic number or the neighborhood growth (Q392191) (← links)
• A framework for scalable greedy coloring on distributed-memory parallel computers (Q436752) (← links)
• Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← links)
• About randomised distributed graph colouring and graph partition algorithms (Q710742) (← links)
• Distributed algorithms for random graphs (Q888436) (← links)
• Lessons from the congested clique applied to MapReduce (Q896148) (← links)
• Design patterns in beeping algorithms: examples, emulation, and analysis (Q1633808) (← links)
• Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge (Q1749842) (← links)
• An experimental analysis of simple, distributed vertex coloring algorithms (Q1763143) (← links)
• Computing fault-containment times of self-stabilizing algorithms using lumped Markov chains (Q2283837) (← links)
• Distributed coloring algorithms for triangle-free graphs (Q2347810) (← links)
• On the complexity of distributed graph coloring with local minimality constraints (Q3057099) (← links)
• Simple Distributed Δ + 1 Coloring in the SINR Model (Q3460713) (← links)
• Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces (Q3677786) (← links)
• A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring (Q3977297) (← links)
• Nearly optimal distributed edge coloring in O(log log n) rounds (Q4344228) (← links)
• (Q5075750) (← links)
• (Q5092346) (← links)
• Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering (Q5112251) (← links)
• EFFICIENT DISTRIBUTED ALGORITHMS FOR TOPOLOGY CONTROL PROBLEM WITH SHORTEST PATH CONSTRAINTS (Q5189986) (← links)
• Euro-Par 2004 Parallel Processing (Q5311346) (← links)
• Superfast coloring in CONGEST via efficient color sampling (Q5918634) (← links)
• Superfast coloring in CONGEST via efficient color sampling (Q5925614) (← links)
• Node and edge averaged complexities of local graph problems (Q6071120) (← links)
• Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts (Q6071121) (← links)
• Distributed ∆-coloring plays hide-and-seek (Q6083498) (← links)
• A note on the network coloring game: a randomized distributed \((\Delta+1)\)-coloring algorithm (Q6161445) (← links)
• Coloring fast without learning your neighbors' colors (Q6535038) (← links)