Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/20079
dc.contributor.author | Li, Zhentao |
---|---|
dc.contributor.author | Sau Valls, Ignasi |
dc.date | 2009 |
dc.identifier.citation | Li, Z.; Sau, I. Graph partitioning and traffic grooming with bounded degree request graph. A: International Workshop on Graph-Theoretic Concepts in Computer Science. "Graph-Theoretic Concepts in Computer Science. 35th InternationalWorkshop, WG 2009 Montpellier, France, June 24-26, 2009: Revised Papers". Montpellier: Springer, 2009, p. 250-261. |
dc.identifier.citation | 3-642-11408-3 |
dc.identifier.citation | 10.1007/978-3-642-11409-0_22 |
dc.identifier.uri | http://hdl.handle.net/2117/20079 |
dc.language.iso | eng |
dc.publisher | Springer |
dc.rights | info:eu-repo/semantics/openAccess |
dc.subject | Àrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telecomunicació òptica |
dc.subject | Àrees temàtiques de la UPC::Informàtica |
dc.subject | Optical networks |
dc.subject | Xarxes òptiques |
dc.title | Graph partitioning and traffic grooming with bounded degree request graph |
dc.type | info:eu-repo/semantics/publishedVersion |
dc.type | info:eu-repo/semantics/conferenceObject |
dc.description.abstract | |
dc.description.abstract | |
dc.description.abstract | |
dc.description.abstract |