scientific article; zbMATH DE number 1263991
From MaRDI portal
Publication:4232883
Cited in
(40)- On Hamiltonian colorings for some graphs
- Three results on frequency assignment in linear cellular networks
- Systems of distant representatives
- On Hamiltonian colorings of graphs
- Theory of computational complexity. Part 7. Transl. from the Russian
- Frequency assignment problem in networks with limited spectrum
- The on-line first-fit algorithm for radio frequency assignment problems.
- Radio and radial radio numbers of certain sunflower extended graphs
- Radio fuzzy graphs and assignment of frequency in radio stations
- The dynamic frequency assignment problem
- When the greedy algorithm fails
- Radiocoloring in planar graphs: Complexity and approximations
- Tabu search for frequency assignment in mobile radio networks
- Systems of pairs of \(q\)-distant representatives, and graph colorings
- On interference graphs
- Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks
- On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations
- Online Frequency Assignment in Wireless Communication Networks
- Three Results on Frequency Assignment in Linear Cellular Networks
- A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
- scientific article; zbMATH DE number 1008460 (Why is no real title available?)
- scientific article; zbMATH DE number 1163710 (Why is no real title available?)
- scientific article; zbMATH DE number 1947394 (Why is no real title available?)
- scientific article; zbMATH DE number 1947436 (Why is no real title available?)
- scientific article; zbMATH DE number 1795717 (Why is no real title available?)
- Hole: An Emerging Character in the Story of Radio k-Coloring Problem
- Radio Labeling with Preassigned Frequencies
- Minimization criteria for frequency planning in cellular radio systems
- scientific article; zbMATH DE number 1862255 (Why is no real title available?)
- A heuristic for fast convergence in interference-free channel assignment using D1EC coloring
- Optimizing distance constraints frequency assignment with relaxation
- Exact solution of a class of frequency assignment problems in cellular networks (extended abstract)
- Static frequency assignment in cellular networks
- Fixed-parameter complexity of \(\lambda\)-labelings
- Models and approximation algorithms for channel assignment in radio networks
- A study on avoiding RFI in the movement of robots via radio resolving number problem
- Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies
- Frequency reassignment problem in mobile communication networks
- On the complexity of bandwidth allocation in radio networks
- Partial integration of frequency allocation within antenna positioning in GSM mobile networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4232883)
