Pages that link to "Item:Q3057099"
From MaRDI portal
The following pages link to On the complexity of distributed graph coloring with local minimality constraints (Q3057099):
Displaying 6 items.
- Symmetry breaking depending on the chromatic number or the neighborhood growth (Q392191) (← links)
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← links)
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs (Q666086) (← links)
- Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge (Q1749842) (← links)
- Linial for lists (Q2104037) (← links)
- Network Decomposition and Distributed Derandomization (Invited Paper) (Q5100942) (← links)
