Computational complexity of some interference graph calculations (mobile radio)
- 1 May 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 39 (2) , 140-149
- https://doi.org/10.1109/25.54230
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Some lower bounds for a class of frequency assignment problemsIEEE Transactions on Vehicular Technology, 1986
- An integrated approach to cellular radio network planningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- A new backtracking algorithm for generating the family of maximal independent sets of a graphComputers & Mathematics with Applications, 1983
- Homogeneous distribution of frequencies in a regular hexagonal cell systemIEEE Transactions on Vehicular Technology, 1982
- A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographicallyComputing, 1981
- Telephone traffic in mobile radio communication system using dynamic frequency assignmentsIEEE Transactions on Vehicular Technology, 1980
- Frequency assignment: Theory and applicationsProceedings of the IEEE, 1980
- Advanced Mobile Phone Service: The Cellular ConceptBell System Technical Journal, 1979
- Traffic Capacity of Three Types of Common-User Mobile Radio Communication SystemsIEEE Transactions on Communications, 1970
- On cliques in graphsIsrael Journal of Mathematics, 1965