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 13 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)
- Complexity analysis of a decentralised graph colouring algorithm (Q963399) (← links)
- Vertex coloring with communication and local memory constraints in synchronous broadcast networks (Q1629936) (← links)
- Polynomial lower bound for distributed graph coloring in a weak LOCAL model (Q1660925) (← links)
- Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge (Q1749842) (← links)
- Linial for lists (Q2104037) (← links)
- Distributed minimum vertex coloring and maximum independent set in chordal graphs (Q2672608) (← links)
- Network Decomposition and Distributed Derandomization (Invited Paper) (Q5100942) (← links)
- Distributed coloring and the local structure of unit-disk graphs (Q5918711) (← links)
- Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074) (← links)
- Local conflict coloring revisited: Linial for lists (Q6535013) (← links)
