Channel assignment and graph multicoloring
暂无分享,去创建一个
[1] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[2] M.J.P. Peeters,et al. On coloring j-unit sphere graphs , 1991 .
[3] Eric J. Schwabe,et al. Worst-case performance of cellular channel assignment policies , 1996, Wirel. Networks.
[4] Tomás Feder,et al. Online Channel Allocation in FDMA Networks with Reuse Constraints , 1998, Inf. Process. Lett..
[5] Lata Narayanan,et al. Worst-case analysis of a dynamic channel assignment strategy , 2004, Discret. Appl. Math..
[6] Brigitte Jaumard,et al. Mathematical Models and Exact Methods For Channel Assignment in Cellular Networks , 1999 .
[7] Noga Alon,et al. Colorings and orientations of graphs , 1992, Comb..
[8] A. Gamst,et al. Some lower bounds for a class of frequency assignment problems , 1986, IEEE Transactions on Vehicular Technology.
[9] Marina Papatriantafilou,et al. Distributed list coloring: how to dynamically allocate frequencies to mobile base stations , 1996, Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing.
[10] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[11] Lata Narayanan,et al. Worst-case analysis of a dynamic channel assignment strategy (extended abstract) , 2000, DIALM '00.
[12] Ming Zhang,et al. Comparisons of channel-assignment strategies in cellular mobile telephone systems , 1989 .
[13] Ioannis Caragiannis,et al. Efficient on-line communication in cellular networks , 2000, SPAA '00.
[14] V. H. Mac Donald,et al. Advanced mobile phone service: The cellular concept , 1979, The Bell System Technical Journal.
[15] Paul G. Spirakis,et al. Competitive Call Control in Mobile Networks , 1997, ISAAC.
[16] Jeannette Janssen. Channel assignment and graph labeling , 2002 .
[17] M. M. Peritsky,et al. Statistically-Optimum Dynamic Server Assignment in Systems with Interfering Servers , 1972, IEEE Trans. Commun..
[18] D. O. Reudink,et al. Dynamic channel assignment in two-dimensional large-scale mobile Radio systems , 1972 .
[19] David J. Goodman,et al. Instability and deadlock of distributed dynamic channel allocation , 1993, IEEE 43rd Vehicular Technology Conference.
[20] Mahmoud Naghshineh,et al. Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey , 2000, IEEE Communications Surveys & Tutorials.
[21] Dorit S. Hochbaum,et al. Efficient bounds for the stable set, vertex cover and set packing problems , 1983, Discret. Appl. Math..
[22] Carsten Thomassen,et al. Every Planar Graph Is 5-Choosable , 1994, J. Comb. Theory B.
[23] Lata Narayanan,et al. Static Frequency Assignment in Cellular Networks , 2001, Algorithmica.
[24] Mukesh Singhal,et al. Distributed dynamic channel allocation for mobile computing , 1995, PODC '95.
[25] J. V. D. Heuvel,et al. Graph labeling and radio channel assignment , 1998 .
[26] Ewa Malesinska. An optimization method for the channel assignment in mixed environments , 1995, MobiCom '95.
[27] Sundar Vishwanathan. Randomized Online Graph Coloring , 1992, J. Algorithms.
[28] Lata Narayanan,et al. Distributed Online Frequency Assignment in Cellular Networks , 2000, J. Algorithms.
[29] Michael E. Saks,et al. An on-line graph coloring algorithm with sublinear performance ratio , 1989, Discret. Math..
[30] Alberto Marchetti-Spaccamela,et al. On-line randomized call control revisited , 1998, SODA '98.
[31] T. Kahwa,et al. A Hybrid Channel Assignment Scheme in Large-Scale, Cellular-Structured Mobile Communication Systems , 1978, IEEE Trans. Commun..
[32] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[33] W. K. Hale. Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.
[34] Harry B. Hunt,et al. Simple heuristics for unit disk graphs , 1995, Networks.
[35] Giorgio Gambosi,et al. On-line algorithms for the channel assignment problem in cellular networks (extended abstract) , 2000, DIALM '00.
[36] Cheng Yang,et al. A Graph Theoretic Approach for Channel Assignment in Cellular Networks , 2001, Wirel. Networks.
[37] A. Gräf,et al. On Coloring Unit Disk Graphs , 1998, Algorithmica.
[38] I Chih-Lin,et al. Local packing-distributed dynamic channel allocation at cellular base station , 1993, Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference.
[39] Tommy R. Jensen,et al. Graph Coloring Problems , 1994 .
[40] Jeannette Janssen,et al. Fixed preference channel assignment for cellular telephone systems , 1996 .
[41] Bruce A. Reed,et al. Colouring proximity graphs in the plane , 1999, Discret. Math..
[42] Wuyi Yue,et al. Analytical methods to calculate the performance of a cellular mobile radio communication system with hybrid channel assignment , 1991 .