Distributed largest-first algorithm for graph coloring
From MaRDI portal
Recommendations
Cited in
(6)- Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring
- A new efficient RLF-like algorithm for the vertex coloring problem
- On graph coloring in a class of parallel local algorithms
- On the recursive largest first algorithm for graph colouring
- Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks
This page was built for publication: Distributed largest-first algorithm for graph coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311346)