Author:
de Gevigney Olivier Durand,Meunier Frédéric,Popa Christian,Reygner Julien,Romero Ayrin
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science,Management Information Systems,Management Science and Operations Research
Reference20 articles.
1. Aharoni R, Holzman R (1998) Fractional kernels in digraphs. J Comb Theor (ser B) 73: 1–6
2. Bermond J-C, Braud L, Coudert D (2007) Traffic grooming on the path. Theor Comput Sci 384: 139–151
3. Bermond J-C, Cosnard M, Coudert D, Pérennes S (February 2006) Optimal solution of the maximum all request path grooming problem. In: Proceedings of the advanced international conference on telecommunications, AICT06, Guadeloupe, France
4. Boros E, Gurvich V (1996) Perfect graphs are perfect solvable. Discret Math 159: 35–55
5. Caragiannis I, Kaklamanis C, Persiano P (2001) Wavelength routing in all-optical tree networks: A survey. Comput Artif Intell 20: 95–120
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献