Pages that link to "Item:Q5284947"
From MaRDI portal
The following pages link to APPLICATION OF THE GRAPH COLORING ALGORITHM TO THE FREQUENCY ASSIGNMENT PROBLEM (Q5284947):
Displaying 6 items.
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← links)
- A column generation and branch-and-cut algorithm for the channel assignment problem (Q941544) (← links)
- Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge (Q1749842) (← links)
- Simple decentralized graph coloring (Q2397096) (← links)
- Constraint and Satisfiability Reasoning for Graph Coloring (Q5129999) (← links)
- Models and solution techniques for frequency assignment problems (Q5920489) (← links)
