Weighted Improper Colouring
From MaRDI portal
Coloring of graphs and hypergraphs (05C15) Applications of graph theory (05C90) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Applications of mathematical programming (90C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Recommendations
- Weighted improper colouring
- Improper coloring of weighted grid and hexagonal graphs
- scientific article; zbMATH DE number 4134069
- Weighted graph colorings
- Bounds and fixed-parameter algorithms for weighted improper coloring
- A coloring problem for weighted graphs
- Weighted coloring in trees
- Weighted coloring in trees
- Improper coloring of unit disk graphs
Cited in
(14)- Colouring weighted bipartite graphs with a co-site constraint
- Spectrum graph coloring and applications to Wi-Fi channel assignment
- Graph imperfection. I
- Weighted improper colouring
- Directed weighted improper coloring for cellular channel allocation
- A comparison of integer programming models for the partial directed weighted improper coloring problem
- Constructive algorithms for the partial directed weighted improper coloring problem
- Improper coloring of weighted grid and hexagonal graphs
- The proportional coloring problem: optimizing buffers in radio mesh networks
- A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
- Channel assignment and weighted coloring
- Bounds on spectrum graph coloring
- Graph-Theoretic Concepts in Computer Science
- Bounds and fixed-parameter algorithms for weighted improper coloring
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 Q3111636)
