Weighted improper colouring

DOI10.1016/j.jda.2012.07.001zbMath1257.05035OpenAlexW2179569280MaRDI QIDQ1932354

R. Modrzejewski, Frédéric Havet, Julio Araujo, Jean-Claude Bermond, Frederic Giroire, Dorian Mazauric

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

zbMATH Keywords

upper boundgraph colouringweighted graphinterferencefrequency assignment problemradio networksimproper colouringnoise of intensity 1noise of intensity 1/2threshold improper colouring problemtotal interferenceweighted improper colouring problemweighted t-improper chromatic number

Mathematics Subject Classification ID

Applications of graph theory (05C90) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Discrete location and assignment (90B80) Coloring of graphs and hypergraphs (05C15)

Related Items (11)

Unnamed Item ⋮ Spectrum graph coloring and applications to Wi-Fi channel assignment ⋮ Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction ⋮ Parameterized (Approximate) Defective Coloring ⋮ On t-relaxed chromatic number of r-power paths ⋮ Bounds on spectrum graph coloring ⋮ On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs ⋮ Channel assignment problem and relaxed 2-distant coloring of graphs ⋮ On (s,t)-relaxed L(1,1)-labelling of trees ⋮ Defective Coloring on Classes of Perfect Graphs ⋮ Vertex coloring edge-weighted digraphs

Uses Software

• CALMA

Cites Work

• An enumerative algorithm for the frequency assignment problem
• Frequency assignment in mobile radio systems using branch-and-cut techniques
• A survey on labeling graphs with a condition at distance two
• Defective coloring revisited
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• New methods to color the vertices of a graph
• The capacity of wireless networks
• Models and solution techniques for frequency assignment problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Weighted improper colouring