Computational complexity of some interference graph calculations (mobile radio)
暂无分享,去创建一个
[1] L. Schiff,et al. Traffic Capacity of Three Types of Common-User Mobile Radio Communication Systems , 1970 .
[2] W. K. Hale. Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.
[3] J.F. Whitehead. Cellular spectrum efficiency via reuse planning , 1985, 35th IEEE Vehicular Technology Conference.
[4] R. Beck,et al. An integrated approach to cellular radio network planning , 1985, 35th IEEE Vehicular Technology Conference.
[5] J. Moon,et al. On cliques in graphs , 1965 .
[6] E. Loukakis. A new backtracking algorithm for generating the family of maximal independent sets of a graph , 1983 .
[7] M. Sengoku. Telephone traffic in mobile radio communication system using dynamic frequency assignments , 1980, IEEE Transactions on Vehicular Technology.
[8] Scott Cameron. The Solution of the Graph-Coloring Problem as a Set-Covering Problem , 1977, IEEE Transactions on Electromagnetic Compatibility.
[9] C. Bron,et al. Algorithm 457: finding all cliques of an undirected graph , 1973 .
[10] E. Kay,et al. Graph Theory. An Algorithmic Approach , 1975 .
[11] A. Gamst,et al. Some lower bounds for a class of frequency assignment problems , 1986, IEEE Transactions on Vehicular Technology.
[12] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[13] V. H. Mac Donald,et al. Advanced mobile phone service: The cellular concept , 1979, The Bell System Technical Journal.
[14] A. Gamst,et al. Homogeneous distribution of frequencies in a regular hexagonal cell system , 1982, IEEE Transactions on Vehicular Technology.