Channel assignment and weighted coloring
From MaRDI portal
Recommendations
Cites work
Cited in
(47)- A 1-local asymptotic 13/9-competitive algorithm for multicoloring hexagonal graphs
- Three results on frequency assignment in linear cellular networks
- Perfectness and imperfectness of unit disk graphs on triangular lattice points
- Optimal channel allocation for several types of cellular radio networks
- Graph covers using \(t\)-colourable vertex sets.
- Homomorphisms of hexagonal graphs to odd cycles
- Worst-case analysis of a dynamic channel assignment strategy
- Graph imperfection. I
- Weighted improper colouring
- 1-local 7/5-competitive algorithm for multicoloring hexagonal graphs
- On the properties of weighted minimum colouring games
- Online coloring a token graph
- Online multi-coloring with advice
- 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs
- Optimal channel assignment with list-edge coloring
- A technique for multicoloring triangle-free hexagonal graphs
- Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable
- Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs
- 1-local 7/5-competitive algorithm for multicoloring hexagonal graphs
- Improper coloring of unit disk graphs
- Improper coloring of weighted grid and hexagonal graphs
- A class of weakly perfect graphs
- On \(L(k, k - 1, \ldots, 1)\) labeling of triangular lattice
- Improper Colourings of Unit Disk Graphs
- 2-local distributed algorithms for generalized coloring of hexagonal graphs
- Online Multi-Coloring with Advice
- Three Results on Frequency Assignment in Linear Cellular Networks
- Better bounds for incremental frequency allocation in bipartite graphs
- A linear time algorithm for \(7\)-\([3]\)coloring triangle-free hexagonal graphs
- scientific article; zbMATH DE number 1163304 (Why is no real title available?)
- scientific article; zbMATH DE number 1944137 (Why is no real title available?)
- A 1-local 4/3-competitive algorithm for multicoloring a subclass of hexagonal graphs
- Tight lower bounds for the complexity of multicoloring
- On irreducible no‐hole L(2, 1)‐coloring of trees
- A Constant-Competitive Algorithm for Online OVSF Code Assignment
- 2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs
- Channel assignment and multicolouring of the induced subgraphs of the triangular lattice
- Approximation algorithms for channel assignment with constraints
- Absolute and asymptotic bounds for online frequency allocation in cellular networks
- Simpler multicoloring of triangle-free hexagonal graphs
- On P₅-free locally split graphs
- New reducible configurations for graph multicoloring with application to the experimental resolution of McDiarmid-Reed's conjecture
- Concurrency constrained scheduling with tree-like constraints
- Online call control in cellular networks revisited
- On algorithms for (P₅, gem)-free graphs
- Greedy online frequency allocation in cellular networks
- A constant-competitive algorithm for online OVSF code assignment
This page was built for publication: Channel assignment and weighted coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4519133)
