Frequency planning and ramifications of coloring
From MaRDI portal
Recommendations
Cited in
(29)- Greedy \(T\)-colorings of graphs
- On the hardness of allocating frequencies for hybrid networks
- Chromatic scheduling and frequency assignment
- On the structure of (even hole, kite)-free graphs
- Modeling the packing coloring problem of graphs
- Inverse interval scheduling via reduction on a single machine
- Regular pattern-free coloring
- On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming
- A novel approach for solving semidefinite programs
- On some applications of the selective graph coloring problem
- An efficient inexact ABCD method for least squares semidefinite programming
- An exact site availability approach to modeling the D-FAP
- Three tabu search methods for the MI-FAP applied to 802.11 networks
- Inverse chromatic number problems in interval and permutation graphs
- Algorithms for the generalized weighted frequency assignment problem
- Graphs and algorithms in communication networks on seven league boots
- Mathematical optimization models for WLAN planning
- A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
- An evolutionary algorithm based on the four-color theorem for location area planning
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints
- Models and solution techniques for frequency assignment problems
- DAB ensemble planning -- problems and techniques
- Elementary landscape decomposition of the frequency assignment problem
- On the hardness of allocating frequencies for hybrid networks
- Proper colorability of segment intersection graphs
- Affine optimal k-proper connected edge colorings
- BCH codes and distance multi- or fractional colorings in hypercubes asymptotically
This page was built for publication: Frequency planning and ramifications of coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4786789)
