Spectrum graph coloring and applications to Wi-Fi channel assignment
From MaRDI portal
Publication:1657008
DOI10.3390/sym10030065zbMath1392.05106arXiv1602.05038OpenAlexW3101652746WikidataQ130120557 ScholiaQ130120557MaRDI QIDQ1657008
Ivan Marsa-Maestre, David Orden, Jose Manuel Gimenez-Guzman, Enrique de la Hoz
Publication date: 13 August 2018
Published in: Symmetry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.05038
Analysis of algorithms and problem complexity (68Q25) Applications of graph theory (05C90) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
Vertex coloring of a graph for memory constrained scenarios ⋮ Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction ⋮ Contrast in greyscales of graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A DSATUR-based algorithm for the equitable coloring problem
- Bandwidth allocation in cellular networks with multiple interferences
- Graph labellings with variable weights, a survey
- \(T\)-colorings of graphs: recent results and open problems
- Graph coloring with adaptive evolutionary algorithms
- A range-compaction heuristic for graph coloring
- Efficient location of resources in cylindrical networks
- A comprehensive survey on particle swarm optimization algorithm and its applications
- On total rainbow \(k\)-connected graphs
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring
- Weighted improper colouring
- Dichotomies properties on computational complexity of \(S\)-packing coloring problems
- A survey on vertex coloring problems
- Distance Coloring
- A generalization of edge-coloring in graphs
- New methods to color the vertices of a graph
- Random graph models of social networks
- Models and solution techniques for frequency assignment problems
This page was built for publication: Spectrum graph coloring and applications to Wi-Fi channel assignment
