Author:
Bermond Jean-Claude,Cosnard Michel,Pérennes Stéphane
Subject
General Computer Science,Theoretical Computer Science
Reference12 articles.
1. J. Araujo, N. Cohen, F. Giroire, F. Havet, Good edge-labelling of graphs, Discrete Applied Mathematics (2011)http://dx.doi.org/10.1016/j.dam.2011.07.021 (in press).
2. B. Beauquier, J.-C. Bermond, L. Gargano, P. Hell, S. Pérennes, U. Vaccaro, Graph problems arising from wavelength-routing in all-optical networks, in: IEEE Workshop on Optics and Computer Science, Geneva, Switzerland, April 1997.
3. Traffic grooming on the path;Bermond;Theoretical Computer Science,2007
4. J.-C. Bermond, M. Cosnard, Minimum number of wavelengths equals load in a dag without internal cycle, in: Parallel and Distributed Processing Symposium, 2007, IPDPS 2007, IEEE International, Long Beach, CA, USA, March 2007, pp. 1–10.
5. J.-C. Bermond, M. Cosnard, D. Coudert, S. Pérennes, Optimal solution of the maximum all request path grooming problem, in: Proceedings of the Advanced International Conference on Telecommunications, AICT06, Guadeloupe, France, February 2006.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献