scientific article; zbMATH DE number 15260
From MaRDI portal
Publication:3977585
[For the entire collection see Zbl 0688.00003.] We consider an application of generalized competition graphs to the channel assignment problem. One example of this problem is the assignment of frequencies for radio communication between aircraft and their ground stations. For example, the Allied Radio Frequency Agency in Brussels is responsible for the management of the military UHF radio frequency band for the NATO nations in Europe. Here we will talk about some interesting graph theoretic questions arising from a special case of this problem.
Recommendations
- \(T\)-graphs and the channel assignment problem
- A graph theoretic approach for channel assignment in cellular networks
- scientific article; zbMATH DE number 3873389
- scientific article; zbMATH DE number 3912431
- Graph imperfection and channel assignment
- Graph-Theoretic Concepts in Computer Science
- Channel assignment on graphs of bounded treewidth
- An Asymptotic Approach to the Channel Assignment Problem
- An approximation algorithm for channel assignment with certain constraints
Cited in
(8)- \((i,j)\) competition graphs
- A characterization of graphs with interval two-step graphs
- Chromatic numbers of competition graphs
- A graph theoretic approach to the slot allocation problem
- Characterization of digraphs with equal domination graphs and underlying graphs
- A competitive scheduling problem and its relevance to UMTS channel assignment
- Interval competition graphs of symmetric digraphs
- Two-step graphs of trees
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 Q3977585)