Weighted improper colouring

DOI10.1016/J.JDA.2012.07.001MaRDI QIDQ1932354zbMATH OpenOpenAlexFDO

Authors R. Modrzejewski, Júlio Araújo, Jean-Claude Bermond, F. Giroire, Frédéric Havet, 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

interferenceupper boundweighted graphgraph colouringfrequency 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) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Network design and communication in computer systems (68M10) Discrete location and assignment (90B80)

Recommendations

• Weighted Improper Colouring
• Improper coloring of weighted grid and hexagonal graphs
• Directed weighted improper coloring for cellular channel allocation
• Channel assignment and weighted coloring
• Constructive algorithms for the partial directed weighted improper coloring problem

Cites work

• scientific article; zbMATH DE number 4134069 (Why is no real title available?)
• scientific article; zbMATH DE number 5764899 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3243267 (Why is no real title available?)
• scientific article; zbMATH DE number 3043302 (Why is no real title available?)
• A survey on labeling graphs with a condition at distance two
• About a Brooks-type theorem for improper colouring
• An enumerative algorithm for the frequency assignment problem
• Defective coloring revisited
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Frequency assignment in mobile radio systems using branch-and-cut techniques
• Models and solution techniques for frequency assignment problems
• New methods to color the vertices of a graph
• The capacity of wireless networks

Cited in

(15)

• Vertex coloring edge-weighted digraphs
• Defective Coloring on Classes of Perfect Graphs
• On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs
• Parameterized (approximate) defective coloring
• On \((s,t)\)-relaxed \(L(1,1)\)-labelling of trees
• Parameterized (approximate) defective coloring
• Spectrum graph coloring and applications to Wi-Fi channel assignment
• Channel assignment problem and relaxed 2-distant coloring of graphs
• Improper coloring of weighted grid and hexagonal graphs
• On \(t\)-relaxed chromatic number of \(r\)-power paths
• Directed weighted improper coloring for cellular channel allocation
• Bounds on spectrum graph coloring
• Constructive algorithms for the partial directed weighted improper coloring problem
• Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction
• Weighted Improper Colouring

Describes a project that uses

Uses Software

• CALMA

This page was built for publication: Weighted improper colouring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1932354)