Author:
Fertin Guillaume,Raspaud André
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference18 articles.
1. A.A Bertossi, C.M. Pinotti, R.B. Tan, Efficient use of radio spectrum in wireless networks with channel separation between close stations, in: Proceedings of the DIAL M for Mobility 2000, Fourth International Workshop on Discrete Algorithms and Methods for Mobile Computing and communications, 2000.
2. Channel assignment with separation for special classes of wireless networks: grids and rings;Bertossi,2002
3. H.L. Bodlaender, T. Kloks, R.B. Tan, J. van Leeuwen. λ-coloring of graphs. in: Proceedings of the STACS 2000: 17th Annual Symposium on Theoretical Aspect of Computer Science, Lecture Notes in Computer Science, vol. 1770, Springer, Berlin, 2000, pp. 395–406.
4. T. Calamoneri, R. Petreschi. L(2,1)-labeling of planar graphs. in: Proceedings of the DIAL M for Mobility 2001, Fifth International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, 2001, pp. 28–33.
5. On L(d,1)-labelings of graphs;Chang;Discrete Math.,2002
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献