Pages that link to "Item:Q1014432"
From MaRDI portal
The following pages link to Linear time self-stabilizing colorings (Q1014432):
Displaying 14 items.
- An efficient self-stabilizing distance-2 coloring algorithm (Q442253) (← 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)
- Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks (Q691628) (← links)
- A self-stabilizing algorithm for cut problems in synchronous networks (Q962165) (← links)
- Self-stabilizing coloration in anonymous planar networks (Q1041773) (← links)
- Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge (Q1749842) (← links)
- Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem (Q2240131) (← links)
- A new self-stabilizing algorithm for maximal \(p\)-star decomposition of general graphs (Q2353636) (← links)
- An Efficient Self-stabilizing Distance-2 Coloring Algorithm (Q3408175) (← links)
- A self-stabilizing algorithm for the st-order problem (Q3499020) (← links)
- Self-stabilizing Cuts in Synchronous Networks (Q3511402) (← links)
- SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS (Q4675877) (← links)
- A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph (Q5445753) (← links)
