Pages that link to "Item:Q1657008"
From MaRDI portal
The following pages link to Spectrum graph coloring and applications to Wi-Fi channel assignment (Q1657008):
Displaying 7 items.
- A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem (Q408371) (← links)
- Bounds on spectrum graph coloring (Q510538) (← links)
- Maximum scan statistics and channel assignment problems in homogeneous wireless networks (Q1019740) (← links)
- Vertex coloring of a graph for memory constrained scenarios (Q2183733) (← links)
- Contrast in greyscales of graphs (Q2307508) (← links)
- Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction (Q2420428) (← links)
- Coloring of graphs associated with commutative rings (Q6584796) (← links)