]. O. Aud07 and . Audouin, CARRIOCAS project: an experimental high bit rate optical network tailored for computing and data intensive distributed applications, Proc. of SPIE, 2007.

C. Cadéré, D. Barth, and S. Vial, Virtualization and allocation of network service resources using graph embedding, 2008 23rd International Symposium on Computer and Information Sciences, 2008.
DOI : 10.1109/ISCIS.2008.4717942

J. [. Diaz, M. Petit, and . Serna, A survey of graph layout problems, ACM Computing Surveys, vol.34, issue.3, pp.313-356, 2002.
DOI : 10.1145/568522.568523

D. [. Garey and . Johnson, Computers and intractability. A guide to the theory of NP-completeness, 1979.

N. Russell, A. H. Ter-hofstede, D. Edmond, and W. M. Van-der-aalst, Workflow resource patterns, 2005.

G. Robins and A. Zelikovsky, Improved steiner tree approximation in graphs, SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, pp.770-779, 2000.