Weighted improper colouring
DOI10.1016/j.jda.2012.07.001zbMath1257.05035MaRDI QIDQ1932354
Frédéric Havet, Jean-Claude Bermond, Frederic Giroire, Julio Araujo, Dorian Mazauric, R. Modrzejewski
Publication date: 18 January 2013
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2012.07.001
upper bound; graph colouring; weighted graph; interference; frequency assignment problem; radio networks; improper colouring; noise of intensity 1; noise of intensity 1/2; threshold improper colouring problem; total interference; weighted improper colouring problem; weighted t-improper chromatic number
05C90: Applications of graph theory
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
94A12: Signal theory (characterization, reconstruction, filtering, etc.)
90B80: Discrete location and assignment
05C15: Coloring of graphs and hypergraphs
Uses Software